The Highest Expected Reward Decoding for HMMs with Application to Recombination Detection
Data Structures and Algorithms
2013-08-06 v1 Genomics
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 \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.
Keywords
Cite
@article{arxiv.1001.4499,
title = {The Highest Expected Reward Decoding for HMMs with Application to Recombination Detection},
author = {Michal Nánási and Tomáš Vinař and Broňa Brejová},
journal= {arXiv preprint arXiv:1001.4499},
year = {2013}
}