Parsing with suffix and prefix dictionaries

Authors:
M. Cohn;Roger I. Khazan
Affiliations:
-;-
Venue:
DCC '96 Proceedings of the Conference on Data Compression
Year:
1996

Citing 0
Cited 6

Work-Optimal Parallel Decoders for LZ2 Data Compression

DCC '00 Proceedings of the Conference on Data Compression
On the bit-complexity of Lempel-Ziv compression

SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Dictionary-symbolwise flexible parsing

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

Journal of Discrete Algorithms
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

We show that greedy left-to-right (right-to-left) parsing is optimal w.r.t. a suffix (prefix) dictionary. To exploit this observation, we show how to construct a static suffix dictionary that supports on-line, linear-time optimal parsing. From this we derive an adaptive on-line method that yields compression comparing favorably to LZW.