An efficient pattern matching algorithm on a subclass of context free grammars

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

Volumn 3340, Issue , 2004, Pages 225-236

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

^a UNIVERSITY OF HELSINKI   (Finland)

^b KYUSHU UNIVERSITY   (Japan)

^c JAPAN SCIENCE AND TECHNOLOGY AGENCY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

CONTEXT FREE LANGUAGES; PATTERN MATCHING; FORMAL LANGUAGES;

COMPRESSION ALGORITHMS; CONTEXT-FREE GRAMMARS; FORMAL LANGUAGE THEORY; GRAMMAR-BASED COMPRESSION; INPUT STRING; PATTERN MATCHING ALGORITHMS; PATTERN STRINGS; PATTERN-MATCHING; TEXT COMPRESSIONS; TEXT STRING; MULTILEVEL PATTERN MATCHING;

CONTEXT FREE GRAMMARS;

EID: 33746186485     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30550-7_19     Document Type: Article

References (20)

1. R. E. Bryant. Symbolic boolean manipulation with ordered binary decision diagrams. ACM Computing Surveys, 24:293-318, 1992.
2. M. Charikar, E. Lehman, D. Liu, R. Panigrahy, M. Prabhakaran, A. Rasala, A. Sahai, and A. Shelat. Approximating the smallest grammar: Kolmogorov complexity in natural models. In Proc. STOC'02, pages 792-801, 2002.
3. M. Crochemore and W. Rytter. Text Algorithms. Oxford University Press, New York, 1994.
4. M. Crochemore and W. Rytter. Jewels of Stringology. World Scientific, 2002.
5. P. Gage. A new algorithm for data compression. The C Users Journal, 12(2), 1994.
6. D. Gusfield. Algorithms on Strings, Trees, and Sequences. Cambridge University Press, New York, 1997.
7. 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.
8. M. Karpinski, W. Rytter, and A. Shinohara. An efficient pattern-matching algorithm for strings with short descriptions. Nordic J. Comput., 4(2):172-186, 1997.
9. J. Kieffer and E. Yang. Grammar-based codes: a new class of universal lossless source codes. IEEE Transactions on Information Theory, 46(3):737-754, 2000.
10. J. Kieffer and E. Yang. Grammar-based codes for universal lossless data compression. Communications in Information and Systems, 2(2):29-52, 2002.
11. J. Kieffer, E. Yang, G. Nelson, and P. Cosman. Universal lossless compression via multilevel pattern matching. IEEE Transactions on Information Theory, 46(4):1227-1245, 2000.
12. J. Larsson and A. Moffat. Offline dictionary-based compression. In Proc. DCC'99, pages 296-305. IEEE Computer Society, 1999.
13. M. Miyazaki, A. Shinohara, and M. Takeda. An improved pattern matching algorithm for strings in terms of straight line programs. Journal of Discrete Algorithms, 1(1):187-204, 2000.
14. C. Nevill-Manning and I. Witten. Compression and explanation using hierarchical grammars. Computer Journal, 40(2/3):103-116, 1997.
15. C. Nevill-Manning and I. Witten. Identifying hierarchical structure in sequences: a linear-time algorithm. J. Artificial Intelligence Research, 7:67-82, 1997.
16. C. Nevill-Manning and I. Witten. Inferring lexical and grammatical structure from sequences. In Proc. DCC'97, pages 265-274. IEEE Computer Society, 1997.
17. C. Nevill-Manning and I. Witten. Phrase hierarchy inference and compression in bounded space. In Proc. DCC'98, pages 179-188. IEEE Computer Society, 1998.
18. W. Rytter. Algorithms on compressed strings and arrays. In Proc. SOFSEM'99, volume 1725 of LNCS, pages 48-65. Springer-Verlag, 1999.
19. W. Rytter. Application of Lempel-Ziv factorization to the approximation of grammar-based compression. Theoretical Comput. Sci., 302(1-3):211-222, 2003.
20. P. Woelfel. Symbolic topological sorting with OBDDs. In Proc. MFCS'03, volume 2747 of LNCS, pages 671-680. Springer-Verlag, 2003.