A boyer-moore type algorithm for compressed pattern matching

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

Volumn 1848, Issue , 2000, Pages 181-194

  Shibata, Yusuke ^a   Matsumoto, Tetsuya ^a   Takeda, Masayuki ^a   Shinohara, Ayumi ^a   Arikawa, Setsuo ^a  

^a KYUSHU UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

BOYER-MOORE; BYTE-PAIR ENCODING; COMPRESSED PATTERN MATCHING; FORMAL FRAMEWORK; PATTERN LENGTH; TEXT LENGTH; TEXT STRING; TIME COMPLEXITY;

PATTERN MATCHING;

EID: 84937407089     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45123-4_17     Document Type: Conference Paper

References (25)

1. A. V. Aho and M. Corasick. Efficient string matching: An aid to bibliographic search. Comm. ACM, 18(6):333-340, 1975.
2. C. Allauzen, M. Crochemore, and M. Rafinot. Factor oracle, sufix oracle. Tech-nical Report IGM-99-08, Institut Gaspard-Monge, 1999.
3. A. Amir, G. Benson, and M. Farach. Let sleeping files lie: Pattern matching in Z-compressed files. Journal of Computer and System Sciences, 52:299-307, 1996.
4. R. Baeza-Yates and G. H. Gonnet. A new approach to text searching. Comm. ACM, 35(10):74-82, 1992.
5. R. S. Boyer and J. S. Moore. A fast string searching algorithm. Comm. ACM, 20(10):62-72, 1977.
6. M. Crochemore, F. Mignosi, A. Restivo, and S. Salemi. Text compression using antidictionaries. In Proc. 26th Internationial Colloquim on Automata, Languages and Programming, pages 261-270. Springer-Verlag, 1999.
7. M. Crochemore and W. Rytter. Text Algorithms. Oxford University Press, New York, 1994.
8. E. S. de Moura, G. Navarro, N. Ziviani, and R. Baeza-Yates. Direct pattern match-ing on compressed text. In Proc. 5th International Symp. on String Processing and Information Retrieval, pages 90-95. IEEE Computer Society, 1998.
9. P. Gage. A new algorithm for data compression. The C Users Journal, 12(2), 1994.
10. T. Kida, Y. Shibata, M. Takeda, A. Shinohara, and S. Arikawa. A unifying frame-work for compressed pattern matching. In Proc. 6th International Symp. on String Processing and Information Retrieval, pages 89-96. IEEE Computer Society, 1999.
11. 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.
12. T. Kida, M. Takeda, A. Shinohara, M. Miyazaki, and S. Arikawa. Multiple pat-tern matching in LZW compressed text. In Proc. Data Compression Conference (DCC'98), pages 103-112. IEEE Computer Society, 1998.
13. D. E. Knuth, J. H. Morris, and V. R. Pratt. Fast pattern matching in strings. SIAM J. Comput, 6(2):323-350, 1977.
14. U. Manber. A text compression scheme that allows fast searching directly in the compressed file. In Proc. 5th Ann. Symp. on Combinatorial Pattern Matching, pages 113-124. Springer-Verlag, 1994.
15. M. Miyazaki, S. Fukamachi, M. Takeda, and T. Shinohara. Speeding up the pattern matching machine for compressed texts. Transactions of Information Processing Society of Japan, 39(9):2638-2648, 1998. (in Japanese).
16. G. Navarro and M. Rafinot. 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.
17. G. Navarro and J. Tarhio. Boyer-Moore string matching over Ziv-Lempel com-pressed text. In Proc. 11th Ann. Symp. on Combinatorial Pattern Matching. Springer-Verlag, 2000. to appear.
18. W. Rytter. Algorithms on compressed strings and arrays. In Proc. 26th Ann. Conf. on Current Trends in Theory and Practice of Infomatics. Springer-Verlag, 1999.
19. Y. Shibata, T. Kida, S. Fukamachi, M. Takeda, A. Shinohara, T. Shinohara, and S. Arikawa. Speeding up pattern matching by text compression. In Proc. 4th Italian Conference on Algorithms and Complexity, pages 306-315. Springer-Verlag, 2000.
20. Y. Shibata, M. Takeda, A. Shinohara, and S. Arikawa. Pattern matching in text compressed by using antidictionaries. In Proc. 10th Ann. Symp. on Combinatorial Pattern Matching, pages 37-49. Springer-Verlag, 1999.
21. N. Uratani and M. Takeda. A fast string-searching algorithm for multiple patterns. Information Processing & Management, 29(6):775-791, 1993.
22. T. A. Welch. A technique for high performance data compression. IEEE Comput., 17:8-19, June 1984.
23. S. Wu and U. Manber. Agrep -a fast approximate pattern-matching tool. In Usenix Winter 1992 Technical Conference, pages 153-162, 1992.
24. S. Wu and U. Manber. Fast text searching allowing errors. Comm. ACM, 35(10):83-91, October 1992.
25. J. Ziv and A. Lempel. A universal algorithm for sequential data compression. IEEE Trans. on Inform. Theory, IT-23(3):337-349, May 1977.