The effect of non-greedy parsing in Ziv-Lempel compression methods

Authors:
R. N. Horspool
Affiliations:
-
Venue:
DCC '95 Proceedings of the Conference on Data Compression
Year:
1995

Citing 5
Cited 7

Parallel algorithms for data compression

Journal of the ACM (JACM)
Data compression: methods and theory

Data compression: methods and theory
Text compression

Text compression
The relationship between greedy parsing and symbolwise text compression

Journal of the ACM (JACM)
A Technique for High-Performance Data Compression

Computer

Parallel Parsing Algorithms for Static Dictionary Compression

IEEE Transactions on Parallel and Distributed Systems
The Effect of Flexible Parsing for Dynamic Dictionary-Based Data Compression

Journal of Experimental Algorithmics (JEA)
Dictionary-symbolwise flexible parsing

IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms
Dictionary-symbolwise flexible parsing

Journal of Discrete Algorithms
Optimized relative Lempel-Ziv compression of genomes

ACSC '11 Proceedings of the Thirty-Fourth Australasian Computer Science Conference - Volume 113
On parsing optimality for dictionary-based text compression-the Zip case

Journal of Discrete Algorithms
FRESCO: Referential Compression of Highly Similar Sequences

IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Most practical compression methods in the LZ77 and LZ78 families parse their input using a greedy heuristic. However the popular gzip compression program demonstrates that modest but significant gains in compression performance are possible if non-greedy parsing is used. Practical implementations for using non-greedy parsing in LZ77 and LZ78 compression are explored and some experimental measurements are presented.