Hidden Markov models.

S R Eddy

doi:10.1016/s0959-440x(96)80056-x

Home/Archive/PubMed

PubMed · 8804822

Hidden Markov models.

S R Eddy

View original source ↗Export metadata ↓

Abstract

'Profiles' of protein structures and sequence alignments can detect subtle homologies. Profile analysis has been put on firmer mathematical ground by the introduction of hidden Markov model (HMM) methods. During the past year, applications of these powerful new HMM-based profiles have begun to appear in the fields of protein-structure prediction and large-scale genome-sequence analysis.

Explore related subjects

Markov Chains Nucleic Acid Conformation Protein Conformation Sequence Alignment Journal Article Research Support, Non-U.S. Gov't Research Support, U.S. Gov't, P.H.S.Review

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

S R Eddy. 1996. Hidden Markov models.. https://doi.org/10.1016/s0959-440x(96)80056-x

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related citations

PubMed1997

Stochastic dynamics of a neural network with inhibitory and excitatory connections.

We analyze the dynamics of a stochastic neural model. We show that an inhibitory neuron incorporated into a population of connected excitatory neurons, stabilizes the oscillations of the total activity.

Markov Chains↗

PubMed1994

Reconstructing trees when sequence sites evolve at variable rates.

For a sequence of colors independently evolving on a tree under a simple Markov model, we consider conditions under which the tree can be uniquely recovered from the "sequence spectrum"-the expected frequencies of the various leaf colorations. This is relevant for phylogenetic analysis (where colors represent nucleotides or amino acids; leaves represent extant taxa) as the sequence spectrum is estimated directly from a collection of aligned sequences. Allowing the rate of the evolutionary process to vary across sites is an important extension over most previous studies-we show that, given suitable restrictions on the rate distribution, the true tree (up to the placement of its root) is uniquely identified by its sequence spectrum. However, if the rate distribution is unknown and arbitrary, then, for simple models, it is possible for every tree to produce the same sequence spectrum. Hence there is a logical barrier to accurate, consistent phylogenetic inference for these models when assumptions about the rate distribution are not made. This result exploits a novel theorem on the action of polynomials with non-negative coefficients on sequences.

Markov Chains↗

PubMed1991

Sample sizes for repeated measurements in dichotomous data.

When the measurement of outcome varies within studied subjects and the cost of additional subjects is high, taking more than one measurement for each subject constitutes a useful alternative to increase the power or to reduce the total cost of the study. In this paper, I present sample size formulae for repeated measurements in dichotomous data under different situations. I also discuss optimal sample allocation for repeated measurements.

Markov Chains↗