Simple and efficient LZW-compressed multiple pattern matching

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

Volumn 7354 LNCS, Issue , 2012, Pages 232-242

  Gawrychowski, Paweł ^a,b  

^a UNIVERSITY OF WROC AW   (Poland)

^b MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

compression; Lempel Ziv Welch; multiple pattern matching

Indexed keywords

BALANCED BINARY SEARCHES; COMBINATORICS ON WORDS; CONSTANT TIME; LEMPEL-ZIV-WELCH; MULTIPLE-PATTERN MATCHING; RUNNING TIME; SUFFIX ARRAYS;

BINARY TREES; COMPACTION;

PATTERN MATCHING;

EID: 84863108106     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-31265-6_19     Document Type: Conference Paper

References (16)

1. Aho, A.V., Corasick, M.J.: Efficient string matching: an aid to bibliographic search. Commun. ACM 18, 333-340 (1975)
2. Amir, A., Benson, G., Farach, M.: Let sleeping files lie: pattern matching in z-compressed files. In: SODA 1994: Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, Philadelphia, PA, USA, pp. 705-714. Society for Industrial and Applied Mathematics (1994)
3. Bender, M.A., Farach-Colton, M.: The LCA Problem Revisited. In: Gonnet, G.H., Viola, A. (eds.) LATIN 2000. LNCS, vol. 1776, pp. 88-94. Springer, Heidelberg (2000)
4. Bender, M.A., Farach-Colton, M.: The level ancestor problem simplified. Theor. Comput. Sci. 321(1), 5-12 (2004)
5. Boyer, R.S., Moore, J.S.: A fast string searching algorithm. Commun. ACM 20(10), 762-772 (1977)
6. Driscoll, J.R., Sarnak, N., Sleator, D.D., Tarjan, R.E.: Making data structures persistent. J. Comput. Syst. Sci. 38(1), 86-124 (1989)
7. Farach, M., Thorup, M.: String matching in Lempel-Ziv compressed strings. In: STOC 1995: Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, pp. 703-712. ACM, New York (1995)
8. Galil, Z.: String matching in real time. J. ACM 28(1), 134-149 (1981)
9. Galil, Z., Seiferas, J.: Time-space-optimal string matching (preliminary report). In: STOC 1981: Proceedings of the Thirteenth Annual ACM Symposium on Theory of Computing, pp. 106-113. ACM, New York (1981)
10. Gawrychowski, P.: Optimal pattern matching in LZW compressed strings. In: Randall, D. (ed.) SODA, pp. 362-372. SIAM (2011)
11. Gawrychowski, P.: Tying up the loose ends in fully LZW-compressed pattern matching. In: Dürr, C., Wilke, T. (eds.) STACS. LIPIcs, vol. 14, pp. 624-635. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2012)
12. Kida, T., Takeda, M., Shinohara, A., Miyazaki, M., Arikawa, S.: Multiple pattern matching in LZW compressed text. In: Proceedings of Data Compression Conference, DCC 1998, pp. 103-112. IEEE (1998)
13. Knuth, D.E., Morris Jr., J.H., Pratt, V.R.: Fast pattern matching in strings. SIAM J. Comput. 6(2), 323-350 (1977)
14. Kosaraju, S.R.: Pattern Matching in Compressed Texts. In: Thiagarajan, P.S. (ed.) FSTTCS 1995. LNCS, vol. 1026, pp. 349-362. Springer, Heidelberg (1995)
15. Morris Jr., J.H., Pratt, V.R.: A linear pattern-matching algorithm. Technical Report 40, University of California, Berkeley (1970)
16. Welch, T.A.: A technique for high-performance data compression. Computer 17(6), 8-19 (1984)