Optimal pattern matching in LZW compressed strings

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2011, Pages 362-372

  Gawrychowski, Pawel ^a  

^a UNIVERSITY OF WROC AW   (Poland)

Author keywords

Compression; Lempel Ziv Welch; Pattern matching

Indexed keywords

ALGORITHMS; COMPACTION;

LEMPEL-ZIV-WELCH; LINEAR TIME; PATTERN MATCHING PROBLEMS;

PATTERN MATCHING;

EID: 79955715388     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611973082.29     Document Type: Conference Paper

References (20)

1. A. Amir and G. Benson. Efficient two-dimensional compressed matching. In Data Compression Conference, pages 279-288, 1992.
2. A. Amir, G. Benson, and M. 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.
3. M. A. Bender and M. Farach-Colton. The lea problem revisited. In LATIN'00: Proceedings of the 4th Latin American Symposium on Theoretical Informatics, pages 88-94, London, UK, 2000. Springer-Verlag.
4. R. S. Boyer and J. S. Moore. A fast string searching algorithm. Commun. ACM, 20(10):762-772, 1977.
5. D. Breslauer. Saving comparisons in the Crochemore- Perrin string matching algorithm. In In Proc. of 1st European Symp. on Algorithms, pages 61-72, 1995.
6. M. Crochemore, C. Hancart, and T. Lecroq. Algorithms on Strings. Cambridge University Press, 2007.
7. M. Farach. Optimal suffix tree construction with large alphabets. In FOCS'97: Proceedings of the 38th Annual Symposium on Foundations of Computer Science, page 137, Washington, DC, USA, 1997. IEEE Computer Society.
8. M. Farach and M. Thorup. String matching in Lempel-Ziv compressed strings. In STOC'95: Proceedings of the twenty-seventh annual ACM symposium on Theory of computing, pages 703-712, New York, NY, USA, 1995. ACM.
9. M. L. Fredman and D. E. Willard. Trans-dichotomous algorithms for minimum spanning trees and shortest paths. J. Comput. Syst. Sci., 48(3):533-551, 1994. (Pubitemid 124013302)
10. Z. Galil. String matching in real time. J. ACM, 28(1):134-149, 1981.
11. Z. Galil and J. 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.
12. L. Gasieniec and W. 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.
13. D. E. Knuth, J. H. Morris, Jr., and V. R. Pratt. Fast pattern matching in strings. SIAM J. Comput., 6(2):323-350, 1977.
14. S. R. 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. J. H. Morris Jr. and V. R. Pratt. A linear pattern- matching algorithm. Technical Report 40, University of California, Berkeley, 1970.
16. G. Navarro and M. Raffinot. A general practical approach to pattern matching over Ziv-Lempel compressed text. In CPM'99: Proceedings of the 10th Annual Symposium on Combinatorial Pattern Matching, pages 14-36, London, UK, 1999. Springer-Verlag.
17. I. Simon. String matching algorithms and automata. In Proceedings of the Colloquium in Honor of Arto Sa-lomaa on Results and Trends in Theoretical Computer Science, pages 386-395, London, UK, 1994. Springer-Verlag.
18. E. Ukkonen. On-line construction of suffix trees. Algorithmica, 14(3):249-260, 1995.
19. T. A. Welch. A technique for high-performance data compression. Computer, 17(6):8-19, 1984.
20. J. Ziv and A. Lempel. A universal algorithm for sequential data compression. IEEE Transactions on Information Theory, 23:337-343, 1977.