A fully compressed pattern matching algorithm for simple collage systems

International Journal of Foundations of Computer Science

Volumn 16, Issue 6, 2005, Pages 1155-1166

  Inenaga, Shunsuke ^a   Shinohara, Ayumi ^b   Takeda, Masayuki ^a,c  

^a KYUSHU UNIVERSITY   (Japan)

^b TOHOKU UNIVERSITY   (Japan)

^c JAPAN SCIENCE AND TECHNOLOGY AGENCY   (Japan)

Author keywords

Algorithm; Collage systems; Fully compressed pattern matching; String processing; Text compression

Indexed keywords

EID: 33746228626     PISSN: 01290541     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0129054105003728     Document Type: Conference Paper

References (23)

1. A. Amir and G. Benson. "Efficient two-dimensional compressed matching," In Proc. DCC'92, page 279. IEEE Computer Society, 1992.
2. A. Amir, G. Benson, and M. Farach. "Let sleeping files lie: Pattern matching in Z-compressed files," J. Computer and System Sciences, 52(6):299-307, 1996.
3. T. Eilam-Tzoreff and U. Vishkin. "Matching patterns in strings subject to multilinear transformations," Theoretical Computer Science, 60:231-254, 1988.
4. M. Farach and M. Thorup. "String matching in Lempel-Ziv compressed strings," Algorithmica, 20(4):388-404, 1998.
5. P. Gage. "A new algorithm for data compression," The C Users Journal, 12(2), 1994.
6. L. Ga̧sieniec, M. Karpinski, W. Plandowski, and W. Rytter. "Efficient algorithms for Lempel-Ziv encoding (extended abstract)," In Proc. SWAT'96, volume 1097 of LNCS, pages 392-403. Springer-Verlag, 1996.
7. L. Ga̧sieniec and W. Rytter. "Almost optimal fully LZW-compressed pattern matching," In Proc. DCC'99, pages 316-325. IEEE Computer Society, 1999.
8. S. Inenaga, A. Shinohara, and M. Takeda. "A fully compressed pattern matching algorithm for simple collage systems," In Proc. PSC'04, pages 98-113. Czech Technical University, 2004.
9. S. Inenaga, A. Shinohara, and M. Takeda. "An efficient pattern matching algorithm on a subclass of context free grammars," In Proc. DLT'04, volume 3340 of LNCS, pages 225-236. Springer-Verlag, 2004.
10. M. Karpinski, W. Rytter, and A. Shinohara. "An efficient pattern-matching algorithm for strings with short descriptions," Nord. J. Comput., 4(2):172-186, 1997.
11. T. Kida, T. Matsumoto, Y. Shibata, M. Takeda, A. Shinohara, and S. Arikawa. "Collage system: a unifying framework for compressed pattern matching," Theoretical Computer Science, 298:253-272, 2003.
12. J. Kieffer and E. Yang. "Grammar-based codes: a new class of universal lossless source codes," IEEE Trans. Inform. Theory, 46(3):737-754, 2000.
13. J. Kieffer and E. Yang. "Grammar-based codes for universal lossless data compression," Communications in Information and Systems, 2(2):29-52, 2002.
14. J. Kieffer, E. Yang, G. Nelson, and P. Cosman. "Universal lossless compression via multilevel pattern matching," IEEE Trans. Inform. Theory, 46(4):1227-1245, 2000.
15. J. Larsson and A. Moffat. "Offline dictionary-based compression," In Proc. DCC'99, pages 296-305. IEEE Computer Society, 1999.
16. T. Matsumoto, T. Kida, M. Takeda, A. Shinohara, and S. Arikawa. "Bit-parallel approach to approximate string matching in compressed texts," In Proc. SPIRE'00, pages 221-228. IEEE Computer Society, 2000.
17. S. Mitarai, M. Hirao, T. Matsumoto, A. Shinohara, M. Takeda, and S. Arikawa. "Compressed pattern matching for SEQUITUR," In Proc. DCC'01, pages 469-480. IEEE Computer Society, 2001.
18. M. Miyazaki, A. Shinohara, and M. Takeda. "An improved pattern matching algorithm for strings in terms of straight line programs," J. Discrete Algorithms, 1(1):187-204, 2000.
19. C. Nevill-Manning and I. Witten. "Identifying hierarchical structure in sequences: a linear-time algorithm," J. Artificial Intelligence Research, 7:67-82, 1997.
20. J. A. Storer and T. G. Szymanski. "Data compression via textual substitution," J. ACM, 29(4):928-951, 1982.
21. T. Welch. "A technique for high performance data compression," IEEE Comput. Magazine, 17(6):8-19, 1984.
22. J. Ziv and A. Lempel, "A universal algorithm for sequential data compression," IEEE Trans. Inform. Theory, 23:337-343, 1977.
23. J. Ziv and A. Lempel. "Compression of individual sequences via variable length coding," IEEE Trans. Inform. Theory, 24:530-536, 1978.