The Highest Expected Reward Decoding for HMMs with Application to Recombination Detection

Details The Highest Expected Reward Decoding for HMMs with Application to Recombination Detection The Highest Expected Reward Decoding for HMMs with Application to Recombination Detection

2010-01-25

arxiv.org/abs/1001.4499v1

Computer Science

Data Structures and Algorithms

Scientific paper

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 \citep{Kall2005,Brejova2007,Gross2007,Brown2010}. 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.

Affiliated with

Also associated with

No associations

Rating

The Highest Expected Reward Decoding for HMMs with Application to Recombination Detection does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The Highest Expected Reward Decoding for HMMs with Application to Recombination Detection, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Highest Expected Reward Decoding for HMMs with Application to Recombination Detection will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-131485