Speeding up HMM decoding and training by exploiting sequence repetitions
DOI10.1007/S00453-007-9128-0zbMATH Open1191.68294OpenAlexW2089092392WikidataQ60143030 ScholiaQ60143030MaRDI QIDQ834590FDOQ834590
Authors: Yury Lifshits, Shay Mozes, Oren Weimann, 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
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
- A coarse-to-fine approach to computing the \(k\)-best Viterbi paths
- scientific article; zbMATH DE number 1099037
Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Algorithms on strings (68W32)
Cites Work
- Error bounds for convolutional codes and an asymptotically optimum decoding algorithm
- Application of Lempel-Ziv factorization to the approximation of grammar-based compression.
- Gaussian elimination is not optimal
- Matrix multiplication via arithmetic progressions
- More algorithms for all-pairs shortest paths in weighted graphs
- On the Complexity of Finite Sequences
- A universal algorithm for sequential data compression
- Matching for run-length encoded strings
- Title not available (Why is that?)
- Algorithms and Data Structures
- Processing Compressed Texts: A Tractability Border
- An improved algorithm for computing the edit distance of run-length coded strings
- Speeding Up HMM Decoding and Training by Exploiting Sequence Repetitions
- Let sleeping files lie: Pattern matching in Z-compressed files.
- Window Subsequence Problems for Compressed Texts
- Title not available (Why is that?)
- Hidden Markov chains and the analysis of genome structure
- Title not available (Why is that?)
- Edit distance of run-length encoded strings.
- Title not available (Why is that?)
Cited In (6)
- \texttt{CarpeDiem}: optimizing the Viterbi algorithm and applications to supervised sequential learning
- Speeding Up HMM Decoding and Training by Exploiting Sequence Repetitions
- The Highest Expected Reward Decoding for HMMs with Application to Recombination Detection
- 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
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 Q834590)
