The effect of flexible parsing for dynamic dictionary-based data compression

We report on the performance evaluation of greedy parsing with a single-step lookahead, denoted as flexible parsing. We also introduce a new fingerprint-based data structure which enables efficient linear-time implementation.

[1]  Serap A. Savari,et al.  On the entropy of DNA: algorithms and measurements based on memory and rapid convergence , 1995, SODA '95.

[2]  Abraham Lempel,et al.  A universal algorithm for sequential data compression , 1977, IEEE Trans. Inf. Theory.

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

[4]  Martin Cohn,et al.  Parsing with suffix and prefix dictionaries , 1996, Proceedings of Data Compression Conference - DCC '96.

[5]  Serap A. Savari,et al.  Redundancy of the Lempel-Ziv incremental parsing rule , 1997, IEEE Trans. Inf. Theory.

[6]  Michael Rodeh,et al.  Linear Algorithm for Data Compression via String Matching , 1981, JACM.

[7]  Ian H. Witten,et al.  Text Compression , 1990, 125 Problems in Text Algorithms.

[8]  Guy Louchard,et al.  Average profile and limiting distribution for a phrase size in the Lempel-Ziv parsing algorithm , 1995, IEEE Trans. Inf. Theory.

[9]  R. Nigel Horspool.  The effect of non-greedy parsing in Ziv-Lempel compression methods , 1995, Proceedings DCC '95 Data Compression Conference.

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

[11]  James A. Storer,et al.  Data Compression: Methods and Theory , 1987 .

[12]  G. Manzini,et al.  Some entropic bounds for Lempel-Ziv algorithms , 1997, Proceedings DCC '97. Data Compression Conference.

[13]  James A. Storer,et al.  Parallel algorithms for data compression , 1985, JACM.

[14]  Philippe Jacquet,et al.  Asymptotic Behavior of the Lempel-Ziv Parsing Scheme and Digital Search Trees , 1995, Theor. Comput. Sci..

[15]  Hidetoshi Yokoo.  Improved variations relating the Ziv-Lempel and Welch-type algorithms for sequential data compression , 1992, IEEE Trans. Inf. Theory.

[16]  Richard M. Karp,et al.  Efficient Randomized Pattern-Matching Algorithms , 1987, IBM J. Res. Dev..