The consensus string problem and the complexity of comparing hidden Markov models
- 1 November 2002
- journal article
- research article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 65 (3) , 545-569
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Clique Is Hard to Approximate within n 1-o(1)2000
- The Pfam Protein Families DatabaseNucleic Acids Research, 2000
- Measures on Hidden Markov ModelsBRICS Report Series, 1999
- Clique is hard to approximate within n1−εActa Mathematica, 1999
- Hidden Markov Models in Computational BiologyJournal of Molecular Biology, 1994
- Hidden Markov models for labeled sequences1994
- On the computational complexity of approximating distributions by probabilistic automataMachine Learning, 1992
- A tutorial on hidden Markov models and selected applications in speech recognitionProceedings of the IEEE, 1989
- Stochastic models for heterogeneous DNA sequencesBulletin of Mathematical Biology, 1989
- Continuous speech recognition by statistical methodsProceedings of the IEEE, 1976