Fully compressed pattern matching algorithm for balanced straight-line programs

Proceedings - 7th International Symposium on String Processing and Information Retrieval, SPIRE 2000

Volumn , Issue , 2000, Pages 132-138

  Hirao, M ^a   Shinohara, A ^a   Takeda, M ^a   Arikawa, S ^a  

^a KYUSHU UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

COMPRESSION RATIO (MACHINERY); INFORMATION RETRIEVAL; PATTERN MATCHING;

BEST-KNOWN ALGORITHMS; COMPRESSED PATTERN MATCHING; STRAIGHT LINE PROGRAM; SUCCINCT REPRESENTATION;

ALGORITHMS;

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

References (10)

1. P. Berman, M. Karpinski, L. L. Larmore, W. Plandowski, and W. Rytter. On the complexity of pattern matching for highly compressed two-dimensional texts. In Proc. 8th Annual Symposium on Combinatorial Pattern Matching, volume 1264 of Lecture Notes in Computer Science, pages 40-51. Springer-Verlag, 1997.
2. M. Crochemore and W. Rytter. Text Algorithms. Oxford University Press, New York, 1994.
3. P. Gage. A new algorithm for data compression. The C Users Journal, 12(2), 1994.
4. M. Karpinski, W. Rytter, and A. Shinohara. Pattern-matching for strings with short descriptions. In Proc. 6th Annual Symposium on Combinatorial Pattern Matching, volume 637 of Lecture Notes in Computer Science, pages 205-214. Springer-Verlag, 1995.
5. M. Karpinski, W. Rytter, and A. Shinohara. An efficient pattern-matching algorithm for strings with short descriptions. Nordic Journal of Computing, 4(2):172-186, 1997.
6. T. Kida, Y. Shibata, M. Takeda, A. Shinohara, and S. Arikawa. A unifying framework for compressed pattern matching. In Proc. 6th International Symposium on String Processing and Information Retrieval, pages 89-96, 1999.
7. M. Miyazaki, A. Shinohara, and M. Takeda. An improved pattern matching algorithm for strings in terms of straight-line programs. In Proc. 8th Annual Symposium on Combinatorial Pattern Matching, volume 1264, pages 1-11, 1997. (to appear in Journal Discrete Algorithms).
8. W. Rytter. Algorithms on compressed strings and arrays. In Proc. 26th Annual Conference on Current Trends in Theory and Practice of Informatics, volume 1725 of Lecture Notes in Computer Science. Springer-Verlag, 1999.
9. 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, 2000.
10. Y. Shibata, T. Matsumoto, M. Takeda, A. Shinohara, and S. Arikawa. A Boyer-Moore type algorithm for compressed pattern matching. In Proc. 11th Annual Symposium on Combinatorial Pattern Matching, volume 1848 of Lecture Notes in Computer Science, pages 181-194, 2000.