论文信息 - Pattern matching in text compressed with the ID heuristic

Pattern matching in text compressed with the ID heuristic

We show an O(m+t) space algorithm to find all the occurrences of a pattern in a text compressed with the ID heuristic that runs in time O(n(m+t)), where m is the pattern length, n is the size of the compressed text and 1 is the maximum target length.

Antonella Cresti | Sergio De Agostino | Piera Barcaccia

[1] Mark N. Wegman,et al. Variations on a theme by Ziv and Lempel , 1985 .

[2] Terry A. Welch,et al. A Technique for High-Performance Data Compression , 1984, Computer.

[3] Gary Benson,et al. Let sleeping files lie: pattern matching in Z-compressed files , 1994, SODA '94.

[4] Gary Benson,et al. Efficient two-dimensional compressed matching , 1992, Data Compression Conference, 1992..

[5] Abraham Lempel,et al. Compression of individual sequences via variable-rate coding , 1978, IEEE Trans. Inf. Theory.

[6] Sergio De Agostino. A parallel decoder for LZ2 compression using the ID update heuristic , 1997, SEQUENCES.

[7] Sergio De Agostino. A Parallel Decoding Algorithm for LZ2 Data Compression , 1995, Parallel Comput..