Speeding Up HMM Decoding and Training by Exploiting Sequence Repetitions
- 13 August 2007
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 4-15
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- All-Pairs Shortest Paths with Real Weights in O(n 3/log n) TimeLecture Notes in Computer Science, 2005
- Approximate String Matching over Ziv—Lempel Compressed Text2000
- Matching for Run-Length Encoded StringsJournal of Complexity, 1999
- Biological Sequence Analysis1998
- Let Sleeping Files Lie: Pattern Matching in Z-Compressed FilesJournal of Computer and System Sciences, 1996
- An improved algorithm for computing the edit distance of run-length coded stringsInformation Processing Letters, 1995
- Hidden markov model based optical character recognition in the presence of deterministic transformationsPattern Recognition, 1993
- Hidden Markov chains and the analysis of genome structureComputers & Chemistry, 1992
- Matrix multiplication via arithmetic progressionsJournal of Symbolic Computation, 1990
- CpG islands as gene markers in the vertebrate nucleusTrends in Genetics, 1987