A General Practical Approach to Pattern Matching over Ziv-Lempel Compressed Text

This publication has 28 references indexed in Scilit:

• A text compression scheme that allows fast searching directly in the compressed file
  ACM Transactions on Information Systems, 1997
• Let Sleeping Files Lie: Pattern Matching in Z-Compressed Files
  Journal of Computer and System Sciences, 1996
• Speeding up two string-matching algorithms
  Algorithmica, 1994
• Longest‐match string searching for ziv‐lempel compression
  Software: Practice and Experience, 1993
• Data compression with factor automata
  Theoretical Computer Science, 1992
• A very fast substring search algorithm
  Communications of the ACM, 1990
• A locally adaptive data compression scheme
  Communications of the ACM, 1986
• Compression of individual sequences via variable-rate coding
  IEEE Transactions on Information Theory, 1978
• A universal algorithm for sequential data compression
  IEEE Transactions on Information Theory, 1977
• Universal codeword sets and representations of the integers
  IEEE Transactions on Information Theory, 1975