Speeding Up HMM Decoding and Training by Exploiting Sequence Repetitions

DOI10.1007/978-3-540-73437-6_4zbMath1138.68420OpenAlexW1553326575WikidataQ60143035 ScholiaQ60143035MaRDI QIDQ3506904

Shay Mozes, Michal Ziv-Ukelson, Oren Weimann

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

HMMdynamic programmingcompressionViterbi

Mathematics Subject Classification ID

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

Related Items (4)

Speeding up HMM decoding and training by exploiting sequence repetitions ⋮ Unified compression-based acceleration of edit-distance computation ⋮ Accelerating Viterbi algorithm on graphics processing units ⋮ Textual data compression in computational biology: algorithmic techniques

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