Improved approximate string matching and regular expression matching on Ziv-Lempel compressed texts

ACM Transactions on Algorithms

Volumn 6, Issue 1, 2009, Pages

  Bille, Philip ^a   Fagerberg, Rolf ^b   Gørtz, Inge Li ^c  

^a IT UNIVERSITY OF COPENHAGEN   (Denmark)

^b UNIVERSITY OF SOUTHERN DENMARK   (Denmark)

^c TECHNICAL UNIVERSITY OF DENMARK   (Denmark)

Author keywords

Approximate string matching; Compressed pattern matching; Regular expression matching; Ziv Lempel

Indexed keywords

APPROXIMATE STRING MATCHING; COMPRESSED PATTERN MATCHING; DICTIONARY COMPRESSION; REGULAR-EXPRESSION MATCHING; SPACE BOUNDS; TIME-SPACE;

PATTERN MATCHING;

DATA COMPRESSION;

EID: 74049088174     PISSN: 15496325     EISSN: 15496333     Source Type: Journal    
DOI: 10.1145/1644015.1644018     Document Type: Article

References (27)

1. AHO,A.V., SETHI, R., ANDULLMAN, J.D. 1986. Compilers: Principles, Techniques, and Tools. Addison- Wesley Longman Publishing, Boston, MA.
2. AMIR, A. AND BENSON, G. 1992a. Efficient two-dimensional compressed matching. In Proceedings of the 2nd Data Compression Conference. 279-288.
3. AMIR, A. AND BENSON, G. 1992b. Two-Dimensional periodicity and its applications. In Proceedings of the 3rd Symposium on Discrete Algorithms. 440-452.
4. AMIR, A., BENSON, G., AND FARACH,M. 1996. Let sleeping files lie: Pattern matching in Z-compressed files. J. Comput. Syst. Sci. 52, 2, 299-307.
5. BILLE, P. 2006. Newalgorithms for regular expression matching. In Proceedings of the 33rd International Colloquium on Automata, Languages and Programming. Lecture Notes in Computer Science, vol.4051. 643-654.
6. BILLE, P. AND FARACH-COLTON, M. 2005. Fast and compact regular expression matching. Submitted for publication. Preprint arxiv.org/cs/0509069.
7. COLE, R. AND HARIHARAN, R. 2002. Approximate string matching: A simpler faster algorithm. SIAM J. Comput. 31, 6, 1761-1782.
8. CROCHEMORE, M., LANDAU, G. M., AND ZIV-UKELSON, M. 2003. A subquadratic sequence alignment algorithm for unrestricted scoring matrices. SIAM J. Comput. 32, 6, 1654-1673.
9. DIETZFELBINGER, M., KARLIN, A., MEHLHORN, K., AUF DER HEIDE, F. M., ROHNERT, H., AND TARJAN, R. 1994. Dynamic perfect hashing: Upper and lower bounds. SIAM J. Comput. 23, 4, 738-761.
10. FARACH, M. AND THORUP, M. 1998. String matching in Lempel-Ziv compressed strings. Algorithmica 20, 4, 388-404.
11. GLUSHKOV, V. M. 1961. The abstract theory of automata. Russian Math. Surv. 16, 5, 1-53.
12. KÄRKKÄINEN, J., NAVARRO, G., AND UKKONEN, E. 2003. Approximate string matching on Ziv-Lempel compressed text. J. Discr. Algor. 1, 3-4, 313-338.
13. KIDA, T., TAKEDA, M., SHINOHARA, A., MIYAZAKI, M., AND ARIKAWA, S. 1998. Multiple pattern matching in LZW compressed text. In Proceedings of the 8th Data Compression Conference. 103-112.
14. LANDAU, G. M. AND VISHKIN, U. 1989. Fast parallel and serial approximate string matching. J. Algor. 10, 2, 157-169.
15. MÄKINEN, V., UKKONEN, E., AND NAVARRO, G. 2003. Approximate matching of run-length compressed strings. Algorithmica 35, 4, 347-369.
16. MATSUMOTO, T.,KIDA, T., TAKEDA,M., SHINOHARA, . A., ANDARIKAWA, S. 2000. Bit-Parallel approach to approximate string matching in compressed texts. In Proceedings of the 7th International Symposium on String Processing and Information Retrieval. 221-228.
17. MCNAUGHTON, R. AND YAMADA, H. 1960. Regular expressions and state graphs for automata. IRE Trans. Electron. Comput. 9, 1, 39-47.
18. MYERS, E. W. 1992. A four-russian algorithm for regular expression pattern matching. J. ACM 39, 2, 430-448.
19. NAVARRO, G. 2001. A guided tour to approximate string matching. ACM Comput. Surv. 33, 1, 31-88. (Pubitemid 33768480)
20. NAVARRO, G. 2003. Regular expression searching on compressed text. J. Discr. Algor. 1, 5-6, 423-443.
21. NAVARRO, G., KIDA, T., TAKEDA, M., SHINOHARA, A., AND ARIKAWA, S. 2001. Faster approximate string matching over compressed text. In Proceedings of the 11th Data Compression Conference. 459.
22. NAVARRO, G. AND RAFFINOT, M. 1998. A general practical approach to pattern matching over Ziv- Lempel compressed text. Tech. rep. TR/DCC-98-112, Department of Computer Science, University of Chile.
23. SELLERS, P. 1980. The theory and computation of evolutionary distances: pattern recognition. J. Algor. 1, 4, 359-373.
24. THOMPSON, K. 1968. Programming techniques: Regular expression search algorithm. Comm. ACM11, 6, 419-422.
25. WELCH, T. A. 1984. A technique for high-performance data compression. IEEE Comput. 17, 6, 8-19.
26. ZIV, J. AND LEMPEL, A. 1977. A universal algorithm for sequential data compression. IEEE Trans. Inform. Theory 23, 3, 337-343.
27. ZIV, J. AND LEMPEL, A. 1978. Compression of individual sequences via variable-rate coding. IEEE Trans. Inform. Theory 24, 5, 530-536.