The Treeterbi and Parallel Treeterbi algorithms: Efficient, optimal decoding for ordinary, generalized and pair HMMs

Bioinformatics

Volumn 23, Issue 5, 2007, Pages 545-554

  Keibler, Evan ^a   Arumugam, Manimozhiyan ^a,b   Brent, Michael R ^a  

^a WASHINGTON UNIVERSITY   (United States)

^b EUROPEAN MOLECULAR BIOLOGY LABORATORY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPLEMENTARY DNA;

5' UNTRANSLATED REGION; ACCURACY; ALGORITHM; ARTICLE; CALCULATION; CHROMOSOME ANALYSIS; CONTROLLED STUDY; DNA SEQUENCE; GENE SEQUENCE; GENOME; HIDDEN MARKOV MODEL; LATENT PERIOD; PREDICTION; PRIORITY JOURNAL; PROBABILITY; PROCESS OPTIMIZATION; SEQUENCE ALIGNMENT; SEQUENCE ANALYSIS;

EID: 34047153463     PISSN: 13674803     EISSN: 13674811     Source Type: Journal    
DOI: 10.1093/bioinformatics/btl659     Document Type: Article

References (34)

1. Anderson,B.D.O. and Moore,J.B. (1979) Forwards and backwards models for finite-state Markov processes. Adv. Appl. Probab., 11, 118-133.
2. Arumugam,M. et al. (2006) Pairagon+N-SCAN_EST: A model-based gene annotation pipeline. Genome Biol., 7 (Suppl 1), S5 1-10.
3. Brown,R.H. et al. (2005) Begin at the beginning: Predicting genes with 5′ UTRs. Genome Res., 15, 742-747.
4. Burge,C. and Karlin,S. (1997) Prediction of complete gene structures in human genomic DNA. J. Mol. Biol., 268, 78-94.
5. Durbin,R. et al. (1998) Biological Sequence Analysis: Probabilistic Models of Proteins and Nucleic Acids. Cambridge University Press, Cambridge, UK.
6. Eddy,S.R. (1995) Multiple alignment using hidden Markov models. Proc. Int. Conf. Intell. Syst. Mol. Biol., 3, 114-120.
7. Eddy,S.R. (1998) Profile hidden Markov models. Bioinformatics, 14, 755-763.
8. Elliot,R.J. et al. (1994) Hidden Markov models: Estimation and control. In Applications of Mathematics. Vol. 29, 2nd edn. Springer-Verlag.
9. Flicek,P. et al. (2003) Leveraging the mouse genome for gene prediction in human: From whole-genome shotgun reads to a global synteny map. Genome Res., 13, 46-54.
10. Forney,G., Jr. (1972) Maximum-likelihood sequence estimation of digital sequences in the presence of intersymbol interference. Information Theory, IEEE T. on, 18, 363.
11. Forney,G.D., Jr. (1973) The viterbi algorithm. Proc. IEEE, 61, 268.
12. Frey,B.J. (1998) Graphical Models for Machine Learning and Digital Communication. The MIT Press, Cambridge, Mass.
13. Grice,J.A. et al. (1997) Reduced space sequence alignment. Comput. Appl. Biosci., 13, 45-53.
14. Gross,S.S. and Brent,M.R. (2005) Using multiple alignments to improve gene prediction. In Miyano, S., Kasif, S., Pevzner, P., Mesirov, J., Istrail, S. and Waterman, M. (eds.) In 9th Annual International Conference, RECOMB 2005. Springer, Boston, pp. 374-388.
15. Gross,S.S. and Brent,M.R. (2006) Using multiple alignments to improve gene prediction. J. Comput. Biol., 13, 379-393.
16. Henderson,J. et al. (1997) Finding genes in DNA with a hidden Markov model. J. Comput. Biol., 4, 127-141.
17. Hirschberg,D.S. (1975) A linear space algorithm for computing maximal common subsequences. Commun. ACM., 18, 341-343.
18. Jordan,M.I. (1998) North Atlantic Treaty Organization. Scientific Affairs Division. In Learning in Graphical Models. Kluwer Academic Publishers, Dordrecht, Boston.
19. Khasminskii,R. and Zeitouni,O. (1996) Asymptotic filtering for finite state Markov chains. Stoch. Proc. Appl., 63, 1-10.
20. Korf,I. et al. (2001) Integrating genomic homology into gene structure prediction. Bioinformatics, 17 (Suppl 1), S140-S148.
21. Krogh,A. et al. (1994) Hidden Markov models in computational biology. Applications to protein modeling. J. Mol. Biol., 235, 1501-1531.
22. Krogh,A. et al. (2001) Predicting transmembrane protein topology with a hidden Markov model: Application to complete genomes. J. Mol. Biol., 305, 567-580.
23. Lindblad-Toh,K. et al. (2005) Genome sequence, comparative analysis and haplotype structure of the domestic dog. Nature, 438, 803-819.
24. Meyer,I.M. and Durbin,R. (2002) Comparative ab initio prediction of gene structures using pair HMMs. Bioinformatics, 18, 1309-1318.
25. Myers,E.W. and Miller,W. (1988) Optimal alignments in linear space. Comput. Appl. Biosci., 4, 11-17.
26. Pachter,L. et al. (2002) Applications of generalized pair hidden markov models to alignment and gene finding problems. J. Comput. Biol., 9, 389-399.
27. Pearl,J. (1988) Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kauffman, CA. San Mateo.
28. Pruitt,K.D. et al. (2005) NCBI Reference Sequence (RefSeq): A curated non-redundant sequence database of genomes, transcripts and proteins. Nucleic Acids Res., 33, D501-D504.
29. Rabiner,L.R. (1989) A tutorial on hidden Markov models and selected applications in speech recognition. Proc IEEE, 77, 257-286.
30. Shue,L. (1999) On performance analysis of state estimators for hidden Markov models. In Doctoral Dissertation. The Australian National University, Canberra.
31. Tarnas,C. and Hughey,R. (1998) Reduced space hidden Markov model training. Bioinformatics, 14, 401-406.
32. Viterbi,A.J. (1967) Error bounds for convolution codes and an asymptotically optimum decoding algorithm. IEEE T. Inform. Theory, 13, 260-267.
33. Wheeler,R. and Hughey,R. (2000) Optimizing reduced-space sequence analysis. Bioinformatics, 16, 1082-1090.
34. Wu,J.Q. et al. (2004) Identification of rat genes by TWINSCAN gene prediction, RT-PCR, and direct sequencing. Genome Res., 14, 665-671.