Speeding up pattern matching by text compression

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

Volumn 1767, Issue , 2000, Pages 306-315

  Shibata, Yusuke ^a   Kida, Takuya ^a   Fukamachi, Shuichi ^b   Takeda, Masayuki ^a   Shinohara, Ayumi ^a   Shinohara, Takeshi ^b   Arikawa, Setsuo ^a  

^a KYUSHU UNIVERSITY   (Japan)

^b KYUSHU INSTITUTE OF TECHNOLOGY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

BYTE-PAIR ENCODING; COMPRESSED FILES; DISK SPACE; RUNNING TIME; SEARCHING TIME; SMALL WORKS; TEXT COMPRESSIONS; TEXT FILE;

PATTERN MATCHING;

EID: 84912109348     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46521-9_25     Document Type: Article

References (27)

1. A. Apostolico and Z. Galil. Pattern Matching Algorithm. Oxford University Press, New York, 1997.
2. S. Arikawa and S. Shiraishi. Pattern matching machines for replacing several character strings. Bulletin of Informatics and Cybernetics, 21(1-2):101-111, 1984.
3. R. Baeza-Yates and G. H. Gonnet. A new approach to text searching. Comm. ACM, 35(10):74-82, 1992.
4. R. S. Boyer and J. S. Moore. A fast string searching algorithm. Comm. ACM, 20(10):62-72, 1977.
5. D. Breslauer. Saving comparisons in the Crochemore-Perrin string matching algorithm. In Proc. of 1st European Symp. on Algorithms, pages 61-72, 1993.
6. M. Crochemore, A. Czumaj, L. Gasieniec, S. Jarominek, T. Lecroq, W. Plandowski, and W. Rytter. Speeding up two string-matching algorithm. Algorithmica, 12(4/5):247-267, 1994.
7. M. Crochemore and D. Perrin. Two-way string-matching. J. ACM, 38(3):651-675, 1991.
8. M. Crochemore and W. Rytter. Text Algorithms. Oxford University Press, New York, 1994.
9. E. S. de Moura, G. Navarro, N. Ziviani, and R. Baeza-Yates. Direct pattern matching on compressed text. In Proc. 5th International Symp. on String Processing and Information Retrieval, pages 90-95. IEEE Computer Society, 1998.
10. P. Gage. A new algorithm for data compression. The C Users Journal, 12(2), 1994.
11. Z. Galil and J. Seiferas. Time-space-optimal string matching. J. Comput. System Sci., 26(3):280-294, 1983.
12. L. Gasieniec, W. Plandowski, and W. Rytter. Constant-space string matching with smaller number of comparisons: Sequential sampling. In Proc. 6th Ann. Symp. on Combinatorial Pattern Matching, pages 78-89. Springer-Verlag, 1995.
13. L. Gasieniec, W. Plandowski, and W. Rytter. The zooming method: a recursive approach to time-space efficient string-matching. Theoret. Comput. Sci, 147(1/2):19- 30, 1995.
14. R. N. Horspool. Practical fast searching in strings. Software-Practice and Experience, 10:501-506, 1980.
15. G. C. Jewell. Text compaction for information retrieval. IEEE SMC Newsletter, 5, 1976.
16. T. Kida, Y. Shibata, M. Takeda, A. Shinohara, and S. Arikawa. A unifying framework for compressed pattern matching. In Proc. 6th International Symp. on String Processing and Information Retrieval, pages 89-96. IEEE Computer Society, 1999.
17. T. Kida, M. Takeda, A. Shinohara, and S. Arikawa. Shift-And approach to pattern matching in LZW compressed text. In Proc. 10th Ann. Symp. on Combinatorial Pattern Matching, pages 1-13. Springer-Verlag, 1999.
18. T. Kida, M. Takeda, A. Shinohara, M. Miyazaki, and S. Arikawa. Multiple pattern matching in LZW compressed text. In J. A. Atorer and M. Cohn, editors, Proc. Data Compression Conference '98, pages 103-112. IEEE Computer Society, 1998.
19. D. E. Knuth, J. H. Morris, and V. R. Pratt. Fast pattern matching in strings. SIAM J. C'omput, 6(2):323-350, 1977.
20. U. Manber. A text compression scheme that allows fast searching directly in the compressed file. In Proc. Combinatorial Pattern Matching, volume 807 of Lecture Notes in Computer Science, pages 113-124. Springer-Verlag, 1994.
21. G. Navarro and M. Raffinot. A general practical approach to pattern matching over Ziv-Lempel compressed text. In Proc. 10th Ann. Symp. on Combinatorial Pattern Matching, pages 14-36. Springer-Verlag, 1999.
22. D. M. Sunday. A very fast substring search algorithm. Comm. ACM, 33(8):132- 142, 1990.
23. M. Takeda. An efficient multiple string replacing algorithm using patterns with pictures. Advances in Software Science and Technology, 2:131-151, 1990.
24. B. W. Watson and G. Zwaan. A taxonomy of sublinear multiple keyword pattern matching algorithms. Sci. of Comput. Programing., 27(2):85-118, 1996.
25. S. Wu and U. Manber. Agrep - a fast approximate pattern-matching tool. In Usenix Winter 1992 Technical Conference, pages 153-162, 1992.
26. S. Wu and U. Manber. Fast text searching allowing errors. Comm. ACM, 35(10):83-91, October 1992.
27. A. C.-C. Yao. The complexity of pattern matching for a random string. SIAM J. Comput., 8(3):368-387, 1979.