Speeding Up HMM Decoding and Training by Exploiting Sequence Repetitions

DOI10.1007/978-3-540-73437-6_4MaRDI QIDQ3506904zbMATH OpenOpenAlexWikidataFDO

Authors Shay Mozes, Oren Weimann, Michal Ziv-Ukelson

Publication date 17 June 2008

Published in Combinatorial Pattern Matching (Search for Journal in Brave)

Full work available at URL http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.101.7100

zbMATH Keywords

compressiondynamic programmingHMMViterbi

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Recommendations

• Speeding up HMM decoding and training by exploiting sequence repetitions
• Viterbi algorithms for hidden semi-Markov models with application to DNA analysis
• The Highest Expected Reward Decoding for HMMs with Application to Recombination Detection
• scientific article; zbMATH DE number 1099037
• Robustifying the Viterbi algorithm

Cited in

(6)

• Accelerating Viterbi algorithm on graphics processing units
• Unified compression-based acceleration of edit-distance computation
• The Highest Expected Reward Decoding for HMMs with Application to Recombination Detection
• Textual data compression in computational biology: algorithmic techniques
• Efficient backward decoding of high-order hidden Markov models
• Speeding up HMM decoding and training by exploiting sequence repetitions

This page was built for publication: Speeding Up HMM Decoding and Training by Exploiting Sequence Repetitions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3506904)