A better method for length distribution modeling in HMMS and its application to gene finding

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

Volumn 2373, Issue , 2002, Pages 190-202

  Brejová, Broňa ^a   Vinař, Tomáš ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

Computational biology; Gene finding; Hidden Markov models; Length distribution

Indexed keywords

BIOINFORMATICS; GENES; GEOMETRY; PATTERN MATCHING; TOPOLOGY;

BIOLOGICAL SEQUENCES; COMPUTATIONAL BIOLOGY; GENE FINDING; GEOMETRIC TAIL; HIDDEN MARKOV MODELS (HMMS); ITS APPLICATIONS; LENGTH DISTRIBUTIONS; NUMBER OF STATE;

HIDDEN MARKOV MODELS;

EID: 29144511447     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45452-7_17     Document Type: Conference Paper

References (10)

1. C. Burge and S. Karlin. Prediction of complete gene structures in human genomic DNA. Journal of Molecular Biology, 268(1):78–94, 1997
2. C. B. Burge. Identification of Genes in Human Genomic DNA. PhD thesis, Department of Mathematics, Stanford University, March 1997
3. M. Burset and R. Guigó. Evaluation of gene structure prediction programs. Ge-nomics, 34(3):353–357, 1996.
4. I. Dunham et al. The DNA sequence of human chromosome 22. Nature, 402(6761):489–495, 1999
5. R. Durbin, S. Eddy, A. Krogh, and G. Mitchison. Biological sequence analysis: Probabilistic models of proteins and nucleic acids. Cambridge University Press, 1998
6. A. Krogh. Two methods for improving performance of an HMM and their application for gene finding. In Proceedings of the 5th International Conference on Intelligent Systems for Molecular Biology (ISMB), pages 179–186, 1997
7. D. Kulp, D. Haussler, M. G. Reese, and F. H. Eeckman. A generalized hidden Markov model for the recognition of human genes in DNA. In Proceedings of the 4th International Conference on Intelligent Systems for Molecular Biology (ISMB), pages 134–142, 1996.
8. L. P. Lim and C. B. Burge. A computational analysis of sequence features involved in recognition of short introns. Proceedings of the National Academy of Sciences USA, 98(20):11193–11198, 2001.
9. R. B. Lyngsø and C. N. S. Pedersen. Complexity of comparing hidden Markov models. Technical Report ALCOMFT-TR-01-144, Algorithms and Complexity – Future Technologies Project (ALCOM-FT), June 2001
10. L. R. Rabiner. A tutorial on Hidden Markov models and selected applications in speech recognition. P roceedings of the IEEE, 77(2):257–285, 1989.