A run-time efficient implementation of compressed pattern matching automata

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

Volumn 5148 LNCS, Issue , 2008, Pages 201-211

  Matsumoto, Tetsuya ^a   Hagio, Kazuhito ^a   Takeda, Masayuki ^a  

^a KYUSHU UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

COMPRESSION RATIO (MACHINERY); DATA COMPRESSION; PATTERN MATCHING; PHASE MODULATION; PROGRAMMING THEORY; ROBOTS;

COMPRESSED PATTERN MATCHING; EFFICIENT IMPLEMENTATION; HIGH COMPRESSION RATIO; HIGH SPEEDS; HUFFMAN CODING; INTERNATIONAL CONFERENCES; PREFIX CODES; RUN-TIME;

TRANSLATION (LANGUAGES);

EID: 50249174004     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-70844-5_21     Document Type: Conference Paper

References (13)

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 files lie: Pattern matching in Z-compressed files. Journal of Computer and System Sciences 52(2), 299-307 (1996)
3. Gage, P.: A new algorithm for data compression. The C Users Journal 12(2) (1994)
4. Kida, T., Matsumoto, T., Shibata, Y., Takeda, M., Shinohara, A., Arikawa, S.: Collage systems: a unifying framework for compressed pattern matching. Theoretical Computer Science 298(1), 253-272 (2003)
5. Kieffer, J.C., Yang, E.-H.: Grammar-based codes: A new class of universal lossless source codes. IEEE Trans. on Information Theory 46(3), 737-754 (2000)
6. Larsson, N.J., Moffat, A.: Offline dictionary-based compression. In: Proc. Data Compression Conference 1999 (DCC 1999), pp. 296-305 (1999)
7. 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)
8. Miyazaki, M., Fukamachi, S., Takeda, M., Shinohara, T.: Speeding up the pattern matching machine for compressed texts. Transactions of Information Processing Society of Japan 39(9), 2638-2648 (1998)
9. Moura, E., Navarro, G., Ziviani, N., Baeza-Yates, R.: Fast and flexible word searching on compressed text. ACM Transactions on Information Systems 18(2), 113-139 (2000)
10. Nevill-Manning, C.G., Witten, I.H., Maulsby, D.L.: Compression by induction of hierarchical grammars. In: Proc. Data Compression Conference 1994 (DCC 1994), pp. 244-253 (1994)
11. 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)
12. 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)
13. 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)