Complexity of comparing hidden markov models

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2223 LNCS, Issue , 2001, Pages 416-428

  Lyngsø, Rune B ^a   Pedersen, Christian N S ^b  

^a University of California Santa Cruz   (United States)

^b AARHUS UNIVERSITY   (Denmark)

Author keywords

Consensus String; Distance Measures; Hidden Markov Models; NP Hardness

Indexed keywords

BASIC THEORY; BIOLOGICAL SEQUENCE ANALYSIS; CONSENSUS STRING; CONSTANT FACTORS; DISTANCE MEASURES; KULLBACK-LEIBLER DISTANCE; MEASURES OF DISTANCE; NP HARDNESS; NP-HARD; DISTANCE MEASURE; NP-HARDNESS;

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL GRAMMARS; COMPUTER SCIENCE; HARDNESS; IMAGE SEGMENTATION; PROBABILITY DISTRIBUTIONS; SPEECH RECOGNITION; MARKOV PROCESSES; PROBABILITY;

HIDDEN MARKOV MODELS;

EID: 23044529124     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45678-3_36     Document Type: Conference Paper

References (16)

1. N. Abe and M. K. Warmuth. On the computational complexity of approximating distributions by probabilistic automata. Machine Learning, 9:205-260, 1992. 426
2. K. Asai, S. Hayamizu, and K. Handa. Prediction of protein secondary structure by the hidden markov model. Comp. Appl. in the Biosciences, 9:141-146, 1993. 417
3. A. Bateman, E. Birney, R. Durbin, S. R. Eddy, K. L. Howe, and E. L. L. Sonnhammer. The Pfam protein families database. Nucleic Acid Research, 28:263-266, 2000. 417
4. T. Batu, L. Fortnow, R. Rubinfeld, W. D. Smith, and P. White. Testing that distributions are close. In Proc. 15th STOC, pages 259-269, 2000. 417
5. G. A. Churchill. Stochastic models for heterogeneous DNA sequences. Bull. Math. Biol., 51:79-94, 1989. 417
6. T. M. Cover and J. A. Thomas. Elements of Information Theory. John Wiley & Sons, New York, 1991. 417, 423
7. (1-o(1)). In Proc. 27th ICALP, volume 1853 of Lecture Notes in Computer Science, pages 2-12, 2000. 419
8. 1-difference algorithm for massive data streams. In Proc. 40th FOCS, pages 501-511, 1999. 417
9. p-difference algorithm for massive data streams. In Proc. 17th STACS, 2000. 417
10. 1-∈. Acta Mathematica, 182:105-142, 1999. 419, 422
11. A. Krogh. Two methods for improving performance of an HMM and their application for gene finding. In Proc. 5th ISMB, pages 179-186, 1997. 417
12. A. Krogh, M. Brown, I. S. Mian, K. Sjolander, and D. Haussler. Hidden markov models in computational biology: Applications to protein modeling. Jour. Mol. Biol, 235:1501-1531, 1994. 417
13. R. B. Lyngsø, C. N. S. Pedersen, and H. Nielsen. Metrics and similarity measures for hidden Markov models. In Proc. 7th ISMB, pages 178-186, 1999. 417, 423, 426, 427
14. L. R. Rabiner. A tutorial on hidden markov models and selected applications in speech recognition. In Proc. of the IEEE, volume 77, pages 257-286, 1989. 417, 419
15. Y. Singer and M. K. Warmuth. Training algorithms for hidden Markov models using entropy based distance functions. In Proc. 9th NIPS, pages 641-647, 1996. 427
16. E. L. L. Sonnhammer, G. von Heijne, and A. Krogh. A hidden Markov model for predicting transmembrane helices in protein sequences. In Proc. 6th ISMB, 1998. 417