Speeding up HMM decoding and training by exploiting sequence repetitions
type: Item
instance of: scholarly article
title: Speeding up HMM decoding and training by exploiting sequence repetitions
zbMATH Open document ID: 1191.68294
author: Yury Lifshits
author: Shay Mozes
author: Oren Weimann
author: Michal Ziv-Ukelson
published in: Algorithmica
publication date: 2009-08-27T00:00:00Z
Mathematics Subject Classification ID: 68P30
Mathematics Subject Classification ID: 68W32
zbMATH DE Number: 5598783
zbMATH Keywords: HMM
zbMATH Keywords: Viterbi
zbMATH Keywords: dynamic programming
zbMATH Keywords: compression
Wikidata QID: Q60143030
MaRDI profile type: Publication
full work available at URL: s00453-007-9128-0
OpenAlex ID: W2089092392
cites work: Matching for run-length encoded strings
cites work: Edit distance of run-length encoded strings.
cites work: Q5616735
cites work: Let sleeping files lie: Pattern matching in Z-compressed files.
cites work: An improved algorithm for computing the edit distance of run-length coded strings
cites work: Window Subsequence Problems for Compressed Texts
cites work: Algorithms and Data Structures
cites work: More algorithms for all-pairs shortest paths in weighted graphs
cites work: Hidden Markov chains and the analysis of genome structure
cites work: Matrix multiplication via arithmetic progressions
cites work: Q4829001
cites work: Q2723951
cites work: Processing Compressed Texts: A Tractability Border
cites work: Speeding Up HMM Decoding and Training by Exploiting Sequence Repetitions
cites work: Application of Lempel-Ziv factorization to the approximation of grammar-based compression.
cites work: Q2728909
cites work: Gaussian elimination is not optimal
cites work: Error bounds for convolutional codes and an asymptotically optimum decoding algorithm
cites work: On the Complexity of Finite Sequences
cites work: A universal algorithm for sequential data compression
DOI: 10.1007/S00453-007-9128-0
description: scientific article; zbMATH DE number 5598783