The highest expected reward decoding for HMMs with application to recombination detection

Authors:
Michal Nánási;Tomáš Vinař;Broňa Brejová
Affiliations:
Faculty of Mathematics, Physics, and Informatics, Comenius University, Bratislava, Slovakia;Faculty of Mathematics, Physics, and Informatics, Comenius University, Bratislava, Slovakia;Faculty of Mathematics, Physics, and Informatics, Comenius University, Bratislava, Slovakia
Venue:
CPM'10 Proceedings of the 21st annual conference on Combinatorial pattern matching
Year:
2010

Citing 3
Cited 0

An HMM posterior decoder for sequence feature prediction that includes homology information

Bioinformatics
The most probable annotation problem in HMMs and its application to bioinformatics

Journal of Computer and System Sciences
Prediction of RNA secondary structure using generalized centroid estimators

Bioinformatics

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.