Fast gapped variants for Lempel-Ziv-Welch compression

Information and Computation

Volumn 205, Issue 7, 2007, Pages 1012-1026

  Apostolico, Alberto ^a,b  

^a UNIVERSITY OF PADOVA   (Italy)

^b Georgia Institute of Technology   (United States)

Author keywords

Data compression by textual substitution; Design and analysis of algorithms; Lossy compression; Pattern matching; Trie; Ziv Lempel Welch phrase parse

Indexed keywords

PATTERN MATCHING;

DATA COMPRESSION BY TEXTUAL SUBSTITUTIONS; DESIGN AND ANALYSIS OF ALGORITHMS; LOSSY COMPRESSIONS; TRIE; ZIV-LEMPEL-WELCH PHRASE PARSE;

DATA COMPRESSION;

EID: 84855189675     PISSN: 08905401     EISSN: 10902651     Source Type: Journal    
DOI: 10.1016/j.ic.2007.03.001     Document Type: Article

References (20)

1. A. Apostolico, M. Comin, L. Parida, Bridging lossy and lossless compression by Motif Pattern Discovery, Electronic Notes in Discrete Mathematics, vol. 21, 2005, pp. 219-225.
2. Full version in: General Theory of Information Transfer and Combinatorics, vol. II of the Report ona Research Project at the ZIF (Center of interdisciplinary studies) in Bielefeld October 1, 2002-August 31, 2003, R. Ahlswede with the assistance of L. Bäumer, N. Cai (Eds.), Springer-Verlag LNCS, 4123, 2006, pp. 787-799.
3. A. Apostolico, M. Comin, L. Parida, Motifs in Ziv-Lempel-Welch Clef, in: Proceedings of IEEE DCC Data Compression Conference, Computer Society Press, 2004, pp. 72-81.
4. A. Apostolico, L. Parida, Incremental paradigms of motif discovery, J. Comput. Biol. 11(1) (2004) 15-25. (Pubitemid 38429361)
5. A. Apostolico, L. Parida, Compression and the wheel of fortune, in: Proceedings of DCC 2003, IEEE Computer Society Press, 2003, pp. 143-152.
6. T. Berger, J. D. Gibson, Lossy source coding, IEEE Trans. Inf. Theory 44(6) (1998) 2693-2723. (Pubitemid 128741904)
7. T. M. Cover, J. A. Thomas, Elements of Information Theory, Wiley-Interscience, 1991.
8. M. Garey, D. Johnson, H. Witsenhausen, The complexity of the generalized Lloyd-Max problem, IEEE Trans. Inf. Theory 28(2) (1982) 255-256.
9. D. E. Knuth, The Art of Computer Programming, Addison-Wesley, Reading, Mass, 1968.
10. A. Lempel, J. Ziv, On the complexity of finite sequences, IEEE Trans. Inf. Theory 22(1976) 75-81.
11. D. S. Modha, Codelet parsing: quadratic-time, sequential, adaptive algorithms for lossy compression, in: Proceedings of DCC 2003, IEEE Computer Society Press, 2003, pp. 223-232.
12. E. M. Reingold, J. Nievergelt, N. Deo, Combinatorial Algorithms: Theory and Practice, Prentice-Hall, Englewood Cliffs, 1977.
13. I. Sadeh, On approximate string matching, in: Proceedings of DCC 1993, IEEE Computer Society Press, 1993, pp. 148-157.
14. T. A. Welch, A technique for high-performance data compression, IEEE Comput. 17(6) (1984) 8-19.
15. A. D. Wyner, J. Ziv, A. J. Wyner, On the role of pattern matching in information theory, IEEE Trans. Inf. Theory 44(6) (1998) 2045-2056. (Pubitemid 128741882)
16. E.-h. Yang, J. C. Kieffer, On the performance of data compression algorithms based upon stringmatching, IEEE Trans. Inf. Theory 44(1) (1998) 47-65. (Pubitemid 128737879)
17. R. Zamir, K. Rose, Natural type selection in adaptive lossy compression, IEEE Trans. Inf. Theory IT-47(1) (2001) 99-111. (Pubitemid 32248196)
18. J. Ziv, A. Lempel, A universal algorithm for sequential data compression, IEEE Trans. Inf. Theory vol. IT-23(3) (1977) 337-343.
19. J. Ziv, A. Lempel, Compression of individual sequences via variable-rate coding, IEEE Trans. Inf. Theory 24(5) (1978) 530-536. (Pubitemid 8631609)
20. J. Ziv, M. Ziv-Ukelson, Personal communication (2005).