A unifying framework for compressed pattern matching

String Processing and Information Retrieval Symposium and International Workshop on Groupware, SPIRE 1999 and CRIWG 1999

Volumn , Issue , 1999, Pages 89-96

  Kida, Takuya ^a   Shibata, Yusuke ^a   Takeda, Masayuki ^a   Shinohara, Ayumi ^a   Arikawa, Setsuo ^a  

^a KYUSHU UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

COMPACTION; COMPUTER SOFTWARE; GROUPWARE; INFORMATION RETRIEVAL;

BYTE-PAIR ENCODING; COMPRESSED PATTERN MATCHING; COMPRESSION METHODS; DICTIONARY-BASED COMPRESSIONS; PATTERN MATCHING ALGORITHMS; STRING MATCHING;

PATTERN MATCHING;

EID: 85013573073     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SPIRE.1999.796582     Document Type: Conference Paper

References (20)

1. 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.
2. A. Apostolico and Z. Galil. Pattern Matching Algorithm. Oxford University Press, New York, 1997.
3. M. Crochemore and W. Rytter. Text Algorithms. Oxford University Press, New York, 1994.
4. 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.
5. E. S. de Moura, G. Navarro, N. Ziviani, and R. Baeza-Yates. Fast sequencial searching on compressed texts allowing errors. In Proc. 21st Ann. International ACM SIGIR Conference on Researchand Development in Information Retrieval, pages 298-306. York Press, 1998.
6. P. Gage. A new algorithm for data compression. The C Users Journal, 12(2), 1994.
7. L. Gasieniec, M. Karpinski, W. Plandowski, and W. Rytter. Efficient algorithms for Lempel-Ziv encoding. In Proc. 5th Scandinavian Workshop on Algorithm Theory, pages 392-403, 1996.
8. L. C. K. Hui. Color set size problem with application to string matching. In Combinatorial Pattern Matching, volume 644 of Lecture Notes in Computer Science, pages 230-243. Springer-Verlag, 1992.
9. M. Karpinski, W. Rytter, and A. Shinohara. An efficient pattern-matching algorithm for strings with short descriptions. Nordic Journal of Computing, 4:172-186, 1997.
10. 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, Lecture Notes in Computer Science. Springer-Verlag, 1999. to appear.
11. 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.
12. S. Kosaraju. Pattern matching in compressed texts. In Proc. Foundation of Software Technology and Theoretical Computer Science, pages 349-362. Springer-Verlag, 1995.
13. M. Miyazaki, A. Shinohara, and M. Takeda. An improved pattern matching algorithm for strings in terms of straightline programs. In Proc. 8th Ann. Symp. on Combinatorial Pattern Matching, volume 1264 of Lecture Notes in Computer Science, pages 1-11. Springer-Verlag, 1997.
14. 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, Lecture Notes in Computer Science. Springer-Verlag, 1999. to appear.
15. M. Nelson. The data compression book. M&T Publishing, Inc., Redwood City, Calif., 1992.
16. 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-CS-161, Department of Informatics, Kyushu University, April 1999.
17. 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, Lecture Notes in Computer Science. Springer-Verlag, 1999. to appear.
18. J. Storer and T. Szymanski. Data compression via textual substitution. J. Assoc. Comput. Mach., 29(4):928-951, Oct 1982.
19. T. A. Welch. A technique for high performance data compression. IEEE Comput., 17:8-19, June 1984.
20. J. Ziv and A. Lempel. Compression of individual sequences via variable-rate coding. IEEE Trans. on Inform. Theory, 24(5):530-536, Sep 1978.