Efficient decoding algorithms for generalized hidden Markov model gene finders

Background: The Generalized Hidden Markov Model (GHMM) has proven a useful framework for the task of computational gene prediction in eukaryotic genomes, due to its flexibility and probabilistic underpinnings. As the focus of the gene finding community shifts toward the use of homology information to improve prediction accuracy, extensions to the basic GHMM model are being explored as possible ways to integrate this homology information into the prediction process. Particularly prominent among these extensions are those techniques which call for the simultaneous prediction of genes in two or more genomes at once, thereby increasing significantly the computational cost of prediction and highlighting the importance of speed and memory efficiency in the implementation of the underlying GHMM algorithms. Unfortunately, the task of implementing an efficient GHMM-based gene finder is already a nontrivial one, and it can be expected that this task will only grow more onerous as our models inc...

• Type: Journal
• Year: 2005
• Where: BMCBI
• Authors: William H. Majoros, Mihaela Pertea, Arthur L. Delcher, Steven Salzberg
• Keywords: BMCBI 2005, Gene Prediction, Ghmm-based Gene Finders, Prediction