Context-sensitive grammar transform: Compression and pattern matching

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

Volumn 5280 LNCS, Issue , 2008, Pages 27-38

  Maruyama, Shirou ^a   Tanaka, Yohei ^b   Sakamoto, Hiroshi ^b   Takeda, Masayuki ^a  

^a KYUSHU UNIVERSITY   (Japan)

^b KYUSHU INSTITUTE OF TECHNOLOGY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ENCODING (SYMBOLS); INFORMATION RETRIEVAL; PATTERN MATCHING; SIGNAL ENCODING;

BOYER MOORE HORSPOOL ALGORITHMS; BYTE-PAIR ENCODING; COMPRESSED PATTERN MATCHING; COMPRESSION ALGORITHMS; COMPRESSION PERFORMANCE; CPM ALGORITHMS; SHORT PATTERNS; TRANSFORM MODELS; AMBI; STOPPER;

CONTEXT SENSITIVE GRAMMARS;

EID: 85041120542     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-89097-3_5     Document Type: Conference Paper

References (18)

1. Amir, A., Benson, G.: Efficient two-dimensional compressed matching. In: Proc. Data Compression Conference 1992 (DCC 1992), p. 279 (1992)
2. Amir, A., Benson, G., Farach, M.: Let sleeping fifes lie: Pattern matching in Z- compressed fifes. J. Comput. Syst. Sci. 52(2), 299-307 (1996)
3. Charikar, M., Lehman, E., Lin, D., Panigrahy, R., Prabhakaran, M., Sahai, A., Shelat, A.: The smallest grammar problem. IEEE Transactions on Information Theory 51(7), 2554-2576 (2005)
4. Crochemore, M., Hancart, C., Lecroq, T,: Algorithms on Strings. Cambridge University Press, Cambridge (2007)
5. Kida, T., Matsumoto, T., Shibata, Y., Takeda, M., Shinohara, A., Arikawa, S.: Collage systems: a unifying framework for compressed pattern matching. Theoret. Comput. Sci. 298(1), 253-272 (2003)
6. Knuth, D.E.: The Art of Computer Programming. Seminumerical Algorithms, vol. II. Addison-Wesley, Reading (1981)
7. Larsson, N.J., Moffat, A.: Off-line dictionary-based compression. Proceedings of the IEEE 88(11), 1722-1732 (2000)
8. Lothaire, M.: Combinatorics on Words. Cambridge University Press, Cambridge (1983)
9. Manber, U.: A text compression scheme that allows fast searching directly in the compressed file. ACM Transactions on Information Systems 15(2), 124-136 (1997)
10. Matsumoto, T., Hagio, K., Takeda, M.: A run-time efficient implementation of compressed pattern matching automata. In: Ibarra, O., Ravikumar, B. (eds.) CIAA 2008. LNCS, vol. 5148. Springer, Heidelberg (2008)
11. Navarro, G., Raffinot, M.: Practical and flexible pattern matching over Ziv-Lempel compressed text. J. Discrete Algorithms 2(3), 347-371 (2004)
12. Rautio, J., Tanninen, J., Tarhio, J.: String matching with stopper encoding and code splitting. In: Apostolico, A., Takeda, M. (eds.) CPM 2002. LNCS, vol. 2373, pp. 42-52. Springer, Heidelberg (2002)
13. Rytter, W.: Application of lempel-ziv factorization to the approximation of grammar-based compression. Theor. Comput. Sci. 302(1-3), 211-222 (2003)
14. Sakamoto, H.: A fully linear-time approximation algorithm for grammar-based compression. J. Discrete Algorithms 3(2-4), 416-430 (2005)
15. Sakamoto, H., Kida, T., Shimozono, S.: A space-saving linear-time algorithm for grammar-based compression. In: Apostolico, A., Melucci, M. (eds.) SPIRE 2004. LNCS, vol. 3246, pp. 218-229. Springer, Heidelberg (2004)
16. Shibata, Y., Kida, T., Fukamachi, S., Takeda, M., Shinohara, A., Shinohara, T., Arikawa, S.: Speeding up pattern matching by text compression. In: Bongiovanni, G., Petreschi, R., Gambosi, G. (eds.) CIAC 2000. LNCS, vol. 1767, pp. 306-315. Springer, Heidelberg (2000)
17. Shibata, Y., Matsumoto, T., Takeda, M., Shinohara, A., Arikawa, S.: A Boyer- Moore type algorithm for compressed pattern matching. In: Giancarlo, R., Sankoff, D. (eds.) CPM 2000. LNCS, vol. 1848, pp. 181-194. Springer, Heidelberg (2000)
18. Yang, E.-H., He, D.-K.: Efficient universal lossless data compression algorithms based on a greedy sequential grammar transform - part two: With context models. IEEE Transactions on Information Theory 49(11), 2874-2894 (2003)