Speeding up HMM decoding and training by exploiting sequence repetitions

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4580 LNCS, Issue , 2007, Pages 4-15

  Mozes, Shay ^a   Weimann, Oren ^a   Ziv Ukelson, Michal ^b  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b TEL AVIV UNIVERSITY   (Israel)

Author keywords

Compression; Dynamic programming; HMM; Viterbi

Indexed keywords

DECODING; DISCRETE TIME CONTROL SYSTEMS; DYNAMIC PROGRAMMING; PROBLEM SOLVING; VITERBI ALGORITHM;

BAUM-WELCH ALGORITHMS; HMM DECODING; RUN LENGTH ENCODING (RLE);

HIDDEN MARKOV MODELS;

EID: 37849040168     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-73437-6_4     Document Type: Conference Paper

References (22)

1. Benson, G., Amir, A., Farach, M.: Let sleeping files lie: Pattern matching in Z-compressed files. Journal of Comp. and Sys. Sciences 52(2), 299-307 (1996)
2. Agazzi, O., Kuo, S.: HMM based optical character recognition in the presence of deterministic transformations. Pattern recognition 26, 1813-1826 (1993)
3. Apostolico, A., Landau, G.M., Skiena, S.: Matching for run length encoded strings. Journal of Complexity 15(1), 4-16 (1999)
4. Baum, L.E.: An inequality and associated maximization technique in statistical estimation for probabilistic functions of a Markov process. Inequalities 3, 1-8 (1972)
5. Bird, A.P.: Cpg-rich islands as gene markers in the vertebrate nucleus. Trends in Genetics 3, 342-347 (1987)
6. Buchsbaum, A.L., Giancarlo, R.: Algorithmic aspects in speech recognition: An introduction. ACM Journal of Experimental Algorithms, 2(1) (1997)
7. Bunke, H., Csirik, J.: An improved algorithm for computing the edit distance of run length coded strings. Information Processing Letters 54, 93-96 (1995)
8. 3/logn) time. In: Proc. 9th Workshop on Algorithms and Data Structures, pp. 318-324 (2005)
9. Churchill, G.A.: Hidden Markov chains and the analysis of genome structure. Computers Chem. 16, 107-115 (1992)
10. Coppersmith, D., Winograd, S.: Matrix multiplication via arithmetical progressions. Journal of Symbolic Computation 9, 251-280 (1990)
11. Crochemore, M., Landau, G., Ziv-Ukelson, M.: A sub-quadratic sequence alignment algorithm for unrestricted cost matrices. In: Proc. 13th Annual ACMSIAM Symposium on Discrete Algorithms, pp. 679-688 (2002)
12. Durbin, R., Eddy, S., Krigh, A., Mitcheson, G.: Biological Sequence Analysis. Cambridge University Press, Cambridge (1998)
13. Karkkainen, J., Navarro, G., Ukkonen, E.: Approximate string matching over ZivLempel compressed text. In: Giancarlo, R., Sankoff, D. (eds.) CPM 2000. LNCS, vol. 1848, pp. 195-209. Springer, Heidelberg (2000)
14. Karkkainen, J., Ukkonen, E.: Lempel-Ziv parsing and sublinear-size index structures for string matching. In: Proc. Third South American Workshop on String Processing (WSP), pp. 141-155 (1996)
15. Makinen, V., Navarro, G., Ukkonen, E.: Approximate matching of run-length compressed strings. In: Proc. 12th Annual Symposium On Combinatorial Pattern Matching (CPM). LNCS, vol. 1645, pp. 1-13. Springer, Heidelberg (1999)
16. Manber, U.: A text compression scheme that allows fast searching directly in the compressed file. In: CPM 2001. LNCS, vol. 2089, pp. 31-49. Springer, Heidelberg (2001)
17. Manning, C., Schutze, H.: Statistical Natural Language Processing. MIT Press, Cambridge (1999)
18. Navarro, G., Kida, T., Takeda, M., Shinohara, A., Arikawa, S.: Faster approximate string matching over compressed text. In: Proc. Data Compression Conference (DCC), pp. 459-468 (2001)
19. Shibata, Y., Kida, T., Fukamachi, S., Takeda, M., Shinohara, A., Shinohara, T., Arikawa, S.: Speeding up pattern matching by text compression. In: Bongiovanni, G., Petreschi, R., Gambosi, G. (eds.) CIAC 2000. LNCS, vol. 1767, pp. 306-315. Springer, Heidelberg (2000)
20. Strassen, V.: Gaussian elimination is not optimal. Numerische Mathematik 13, 354-356 (1969)
21. Viterbi, A.: Error bounds for convolutional codes and an asymptotically optimal decoding algorithm. IEEE Transactions on Information Theory IT-13, 260-269 (1967)
22. Ziv, J., Lempel, A.: On the complexity of finite sequences. IEEE Transactions on Information Theory 22(1), 75-81 (1976)