Pattern matching in Lempel-Ziv compressed strings: Fast, Simple, and deterministic

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

Volumn 6942 LNCS, Issue , 2011, Pages 421-432

  Gawrychowski, Paweł ^a  

^a UNIVERSITY OF WROC AW   (Poland)

Author keywords

compression; Lempel Ziv; pattern matching

Indexed keywords

ASYMPTOTICALLY OPTIMAL; COMPRESSION METHODS; LEMPEL-ZIV; PATTERN MATCHING PROBLEMS; REAL-LIFE APPLICATIONS; SPACE COMPLEXITY; SUBSTRING; TIME ALGORITHMS;

ALGORITHMS; COMPACTION;

PATTERN MATCHING;

EID: 80052794470     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-23719-5_36     Document Type: Conference Paper

References (14)

1. Amir, A., Benson, G., Farach, M.: Let sleeping files lie: pattern matching in zcompressed files. In: SODA 1994: Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 705-714. SIAM, Philadelphia (1994)
2. 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)
3. Charikar, M., Lehman, E., Liu, D., Panigrahy, R., Prabhakaran, M., Rasala, A., Sahai, A., Shelat, A.: Approximating the smallest grammar: Kolmogorov complexity in natural models. In: STOC 2002: Proceedings of the Thiry-Fourth Annual ACM Symposium on Theory of Computing, pp. 792-801. ACM, New York (2002)
4. Farach, M., Muthukrishnn, S.: Perfect hashing for strings: Formalization and algorithms. In: Hirschberg, D.S., Meyers, G. (eds.) CPM 1996. LNCS, vol. 1075, pp. 130-140. Springer, Heidelberg (1996)
5. 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)
6. Gawrychowski, P.: Optimal pattern matching in LZW compressed strings. In: SODA 2011: Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms (2011)
7. Iacono, J., Özkan, Ö.: Mergeable dictionaries. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds.) ICALP 2010. LNCS, vol. 6198, pp. 164-175. Springer, Heidelberg (2010)
8. Kärkkäinen, J., Sanders, P., Burkhardt, S.: Linear work suffix array construction. J. ACM 53(6), 918-936 (2006)
9. Karp, R.M., Rabin, M.O.: Efficient randomized pattern-matching algorithms. IBM J. Res. Dev. 31(2), 249-260 (1987)
10. Kida, T., Matsumoto, T., Shibata, Y., Takeda, M., Shinohara, A., Arikawa, S.: Collage system: a unifying framework for compressed pattern matching. Theor. Comput. Sci. 298, 253-272 (2003)
11. Kosaraju, S.R.: Pattern matching in compressed texts. In: Thiagarajan, P.S. (ed.) FSTTCS 1995. LNCS, vol. 1026, pp. 349-362. Springer, Heidelberg (1995)
12. Rytter, W.: Application of Lempel-Ziv factorization to the approximation of grammar-based compression. Theor. Comput. Sci. 302(1-3), 211-222 (2003)
13. Ukkonen, E.: On-line construction of suffix trees. Algorithmica 14(3), 249-260 (1995)
14. Yao, A.C.C.: Lower bounds for algebraic computation trees with integer inputs. In: Proceedings of the 30th Annual Symposium on Foundations of Computer Science, pp. 308-313. IEEE Computer Society, Washington, DC, USA (1989)