Tying up the loose ends in fully LZW-compressed pattern matching

Leibniz International Proceedings in Informatics, LIPIcs

Volumn 14, Issue , 2012, Pages 624-635

  Gawrychowski, Pawel ^a  

^a UNIVERSITY OF WROC AW   (Poland)

Author keywords

Compression; Lempel Ziv Welch; Pattern matching

Indexed keywords

EXACT-PATTERN MATCHING; LEMPEL-ZIV-WELCH; LINEAR-TIME SOLUTIONS; NATURAL GENERALIZATION; PATTERN MATCHING PROBLEMS;

COMPACTION; COMPUTER SCIENCE;

PATTERN MATCHING;

EID: 84863099930     PISSN: 18688969     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.4230/LIPIcs.STACS.2012.624     Document Type: Conference Paper

References (17)

1. Amihood Amir, Gary Benson, and Martin Farach. Let sleeping files lie: pattern matching in z-compressed files. In SODA '94: Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms, pages 705-714, Philadelphia, PA, USA, 1994. Society for Industrial and Applied Mathematics.
2. Michael A. Bender and Martin Farach-Colton. The LCA problem revisited. In LATIN '00: Proceedings of the 4th Latin American Symposium on Theoretical Informatics, pages 88-94, London, UK, 2000. Springer-Verlag.
3. Michael A. Bender and Martín Farach-Colton. The level ancestor problem simplified. Theor. Comput. Sci., 321(1): 5-12, 2004.
4. Robert S. Boyer and J. Strother Moore. A fast string searching algorithm. Commun. ACM, 20(10): 762-772, 1977.
5. Dany Breslauer. Saving comparisons in the Crochemore-Perrin string matching algorithm. In In Proc. of 1st European Symp. on Algorithms, pages 61-72, 1995.
6. Dany Breslauer. The suffix tree of a tree and minimizing sequential transducers. In Proceedings of the 7th Annual Symposium on Combinatorial Pattern Matching, CPM '96, pages 116-129, London, UK, 1996. Springer-Verlag.
7. Maxime Crochemore and Wojciech Rytter. Jewels of stringology. World Scientific, 2002.
8. Zvi Galil. String matching in real time. J. ACM, 28(1): 134-149, 1981.
9. Zvi Galil and Joel Seiferas. Time-space-optimal string matching (preliminary report). In STOC '81: Proceedings of the thirteenth annual ACM symposium on Theory of computing, pages 106-113, New York, NY, USA, 1981. ACM.
10. Leszek Gasieniec, Marek Karpinski, Wojciech Plandowski, and Wojciech Rytter. Efficient algorithms for Lempel-Ziv encoding (extended abstract). In SWAT, pages 392-403, 1996.
11. Leszek Gasieniec and Wojciech Rytter. Almost optimal fully LZW-compressed pattern matching. In DCC '99: Proceedings of the Conference on Data Compression, page 316, Washington, DC, USA, 1999. IEEE Computer Society.
12. Pawel Gawrychowski. Optimal pattern matching in LZW compressed strings. In SODA '11: Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete algorithms, pages 362-372, 2011.
13. Donald E. Knuth, James H. Morris, Jr., and Vaughan R. Pratt. Fast pattern matching in strings. SIAM J. Comput., 6(2): 323-350, 1977.
14. S. Rao Kosaraju. Pattern matching in compressed texts. In Proceedings of the 15th Conference on Foundations of Software Technology and Theoretical Computer Science, pages 349-362, London, UK, 1995. Springer-Verlag.
15. S.R. Kosaraju. Efficient tree pattern matching. Foundations of Computer Science, Annual IEEE Symposium on, 0: 178-183, 1989.
16. James H. Morris, Jr. and Vaughan R. Pratt. A linear pattern-matching algorithm. Technical Report 40, University of California, Berkeley, 1970.
17. Tetsuo Shibuya. Constructing the suffix tree of a tree with a large alphabet. In Proceedings of the 10th International Symposium on Algorithms and Computation, ISAAC '99, pages 225-236, London, UK, 1999. Springer-Verlag.