The Highest Expected Reward Decoding for HMMs with Application to Recombination Detection
Hidden Markov models are traditionally decoded by the Viterbi algorithm which finds the highest probability state path in the model. In recent years, several limitations of the Viterbi decoding have been demonstrated, and new algorithms have been developed to address them (Kall et al., 2005; Brejova et al., 2007; Gross et al., 2007; Brown and Truszkowski, 2010). In this paper, we propose a new efficient highest expected reward decoding algorithm (HERD) that allows for uncertainty in boundaries of individual sequence features. We demonstrate usefulness of our approach on jumping HMMs for recombination detection in viral genomes.
Keywordshidden Markov models decoding algorithms recombination detection jumping HMMs
Unable to display preview. Download preview PDF.
- Brown, D.G., Truszkowski, J.: New decoding algorithms for hidden Markov models using distance measures on labellings. BMC Bioinformatics 11(S1), S40 (2010)Google Scholar
- Felsenstein, J.: Inferring phylogenies. Sinauer Associates (2004)Google Scholar
- Gross, S.S., Do, C.B., Sirota, M., Batzoglou, S.: CONTRAST: a discriminative, phylogeny-free approach to multiple informant de novo gene prediction. Genome Biology 8(12), R269 (2007)Google Scholar
- Kurtz, S., Phillippy, A., Delcher, A.L., Smoot, M., Shumway, M., Antonescu, C., Salzberg, S.L.: Versatile and open software for comparing large genomes. Genome Biology 5(2), R12 (2004)Google Scholar