A unified algorithm for accelerating edit-distance computation via text-compression

Leibniz International Proceedings in Informatics, LIPIcs

Volumn 3, Issue , 2009, Pages 529-540

  Hermelin, Danny ^a   Landau, Gad M ^a,b   Landau, Shir ^c   Weimann, Oren ^d  

^a UNIVERSITY OF HAIFA   (Israel)

^b POLYTECHNIC UNIVERSITY   (United States)

^c BAR ILAN UNIVERSITY   (Israel)

^d MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Combinatorial pattern matching; Dynamic programming acceleration via compression; Edit distance; Straight line programs

Indexed keywords

BYTE-PAIR ENCODING; COMBINATORIAL PATTERN MATCHING; COMPRESSIBILITY PROPERTIES; COMPRESSION METHODS; COMPRESSION SCHEME; EDIT DISTANCE; RUN-LENGTH ENCODING; STRAIGHT LINE PROGRAM;

ALGORITHMS; COMPUTER SCIENCE; PATTERN MATCHING;

RATIONAL FUNCTIONS;

EID: 84880203708     PISSN: 18688969     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (33)

1. A. Aggarwal, M.M. Klawe, S. Moran, P. Shor, and R. Wilber. Geometric applications of a matrix-searching algorithm. Algorithmica, 2:195-208, 1987.
2. A. Amir, G. Benson, and M. Farach. Let sleeping files lie: Pattern matching in Z-compressed files. Journal of Comp. and Sys. Sciences, 52(2):299-307, 1996.
3. A. Amir, G.M. Landau, and D. Sokol. Inplace 2d matching in compressed images. In Proc. of the 14th annual ACM-SIAM Symposium On Discrete Algorithms, (SODA), pages 853-862, 2003.
4. A. Apostolico, M.J. Atallah, L.L. Larmore, and S. McFaddin. Efficient parallel algorithms for string editing and related problems. SIAM Journal on Computing, 19(5):968-988, 1990.
5. A. Apostolico, G.M. Landau, and S. Skiena. Matching for run length encoded strings. Journal of Complexity, 15(1):4-16, 1999.
6. O. Arbell, G. M. Landau, and J. Mitchell. Edit distance of run-length encoded strings. Information Processing Letters, 83(6):307-314, 2001.
7. P. Bille and M. Farach-Colton. Fast and compact regular expression matching. CoRR, 2005.
8. H. Bunke and J. Csirik. An improved algorithm for computing the edit distance of run length coded strings. Information Processing Letters, 54:93-96, 1995.
9. P. Cégielski, I. Guessarian, Y. Lifshits, and Y. Matiyasevich. Window subsequence problems for compressed texts. In Proc. of the 1st symp. on Computer Science in Russia (CSR), pages 127-136, 2006.
10. M. Crochemore, G.M. Landau, and M. Ziv-Ukelson. A subquadratic sequence alignment algorithm for unrestricted scoring matrices. SIAM Journal on Computing, 32:1654-1673, 2003.
11. D. Gusfield. Algorithms on Strings, Trees, and Sequences. Computer Science and Computational Biology. Cambridge University Press, 1997.
12. J. Karkkainen, G. Navarro, and E. Ukkonen. Approximate string matching over Ziv-Lempel compressed text. In Proc. of the 11th symposium on Combinatorial Pattern Matching (CPM), pages 195-209, 2000.
13. J. Karkkainen and E. Ukkonen. Lempel-Ziv parsing and sublinear-size index structures for string matching. In Proc. of the 3rd South American Workshop on String Processing (WSP), pages 141-155, 1996.
14. M. Karpinski, W. Rytter, and A. Shinohara. Pattern-matching for strings with short descriptions. In Proc. of the 6th symposium on Combinatorial Pattern Matching (CPM), pages 205-214, 1995.
15. E. Lehman and A. Shelat. Approximation algorithms for grammar-based compression. In Proc. of the 13th annual ACM-SIAM Symposium On Discrete Algorithms, (SODA), pages 205-212, 2002.
16. V.I. Levenshtein. Binary codes capable of correcting deletions, insertions and reversals. Soviet Physics Doklady, 10(8):707-710, 1966.
17. Y. Lifshits. Processing compressed texts: A tractability border. In Proc. of the 18th symposium on Combinatorial Pattern Matching (CPM), pages 228-240, 2007.
18. Y. Lifshits and M. Lohrey. Querying and embedding compressed texts. In Proc. of the 31st international symposium on Mathematical Foundations of Computer Science (MFCS), pages 681-692, 2006.
19. V. Makinen, G. Navarro, and E. Ukkonen. Approximate matching of run-length compressed strings. In Proc. of the 12th Symposium On Combinatorial Pattern Matching (CPM), pages 1-13, 1999.
20. U. Manber. A text compression scheme that allows fast searching directly in the compressed file. In Proc of the 5th Symposium On Combinatorial Pattern Matching (CPM), pages 31-49, 1994.
21. W.J. Masek and M.S. Paterson. A faster algorithm computing string edit distances. Journal of Computer and System Sciences, 20, 1980.
22. M. Miyazaki, A. Shinohara, and M. Takeda. An improved pattern matching algorithm for strings in terms of straight-line programs. In Proc. of the 8th symposium on Combinatorial Pattern Matching (CPM), pages 1-11, 1997.
23. S. Mozes, O. Weimann, and M. Ziv-Ukelson. Speeding up HMM decoding and training by exploiting sequence repetitions. In Proc. of the 18th symposium on Combinatorial Pattern Matching (CPM), pages 4-15, 2007.
24. G. Navarro, T. Kida, M. Takeda, A. Shinohara, and S. Arikawa. Faster approximate string matching over compressed text. In Proc. of the 11th Data Compression Conference (DCC), pages 459-468, 2001.
25. W. Rytter. Application of Lempel-Ziv factorization to the approximation of grammar-based compression. Theoretical Computer Science, 302(1-3):211-222, 2003.
26. J.P. Schmidt. All highest scoring paths in weighted grid graphs and their application to finding all approximate repeats in strings. SIAM Journal on Computing, 27(4):972-992, 1998.
27. Y. Shibata, T. Kida, S. Fukamachi, M. Takeda, A. Shinohara, T. Shinohara, and S. Arikawa. Byte Pair encoding: A text compression scheme that accelerates pattern matching. Technical Report DOI-TR-161, Department of Informatics, Kyushu University, 1999.
28. Y. Shibata, T. Kida, S. Fukamachi, M. Takeda, A. Shinohara, T. Shinohara, and S. Arikawa. Speeding up pattern matching by text compression. In Proc. of the 4th Italian Conference Algorithms and Complexity (CIAC), pages 306-315, 2000.
29. A. Tiskin. Faster subsequence recognition in compressed strings. J. of Mathematical Sciences, to appear.
30. A. Tiskin. All semi-local longest common subsequences in subquadratic time. In Proc. of the 1st Computer Science symposium in Russia (CSR), pages 352-363, 2006.
31. R. Wagner and M. Fischer. The string-to-string correction problem. J. of the ACM, 21(1):168-173, 1974.
32. J. Ziv and A. Lempel. On the complexity of finite sequences. IEEE Transactions on Information Theory, 22(1):75-81, 1976.
33. J. Ziv and A. Lempel. A universal algorithm for sequential data compression. IEEE Transactions on Information Theory, 23(3):337-343, 1977.