Speeding up HMM decoding and training by exploiting sequence repetitions
From MaRDI portal
Publication:834590
DOI10.1007/s00453-007-9128-0zbMath1191.68294WikidataQ60143030 ScholiaQ60143030MaRDI QIDQ834590
Oren Weimann, Shay Mozes, Yury Lifshits, Michal Ziv-Ukelson
Publication date: 27 August 2009
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-007-9128-0
68P30: Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science)
68W32: Algorithms on strings
Related Items
Textual data compression in computational biology: algorithmic techniques, A faster algorithm for the computation of string convolutions using LZ78 parsing, Accelerating Viterbi algorithm on graphics processing units
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An improved algorithm for computing the edit distance of run-length coded strings
- Matrix multiplication via arithmetic progressions
- Let sleeping files lie: Pattern matching in Z-compressed files.
- Matching for run-length encoded strings
- Application of Lempel-Ziv factorization to the approximation of grammar-based compression.
- Edit distance of run-length encoded strings.
- Gaussian elimination is not optimal
- Window Subsequence Problems for Compressed Texts
- Speeding Up HMM Decoding and Training by Exploiting Sequence Repetitions
- Processing Compressed Texts: A Tractability Border
- More algorithms for all-pairs shortest paths in weighted graphs
- Hidden Markov chains and the analysis of genome structure
- On the Complexity of Finite Sequences
- A universal algorithm for sequential data compression
- Algorithms and Data Structures
- Error bounds for convolutional codes and an asymptotically optimum decoding algorithm
