The Highest Expected Reward Decoding for HMMs with Application to Recombination Detection
From MaRDI portal
Publication:3575245
DOI10.1007/978-3-642-13509-5_16zbMath1286.92043arXiv1001.4499OpenAlexW1506654643WikidataQ57689930 ScholiaQ57689930MaRDI QIDQ3575245
Michal Nánási, Tomáš Vinař, Broňa Brejová
Publication date: 26 July 2010
Published in: Combinatorial Pattern Matching (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1001.4499
Protein sequences, DNA sequences (92D20) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Information theory (general) (94A15)
Related Items (1)
This page was built for publication: The Highest Expected Reward Decoding for HMMs with Application to Recombination Detection