A fully linear-time approximation algorithm for grammar-based compression

Journal of Discrete Algorithms

Volumn 3, Issue 2-4, 2005, Pages 416-430

  Sakamoto, Hiroshi ^a  

^a KYUSHU INSTITUTE OF TECHNOLOGY   (Japan)

Author keywords

Approximation algorithm; Grammar based compression; Linear time algorithm; Lossless data compression

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; ENCODING (SYMBOLS); OPTIMIZATION; PROBLEM SOLVING; TREES (MATHEMATICS);

APPROXIMATION ALGORITHMS; GRAMMER-BASED COMPRESSION; LINEAR-TIME ALGORITHM; LOSSLESS DATA COMPRESSION;

CONTEXT FREE GRAMMARS;

EID: 18544376055     PISSN: 15708667     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jda.2004.08.016     Document Type: Conference Paper

References (21)

1. G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann, A. Marchetti-Spaccamela, and M. Protasi Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties 1999 Springer
2. S. De Agostino, and J.A. Storer On-line versus off-line computation in dynamic text compression Inform. Process. Lett. 59 1996 169 174
3. M. Charikar, E. Lehman, D. Liu, R. Panigrahy, M. Prabhakaran, A. Rasala, A. Sahai, and A. Shelat Approximating the smallest grammar: Kolmogorov complexity in natural models Proc. 29th Ann. Symp. Theory Comput. 2002 792 801
4. M. Farach Optimal suffix tree construction with large alphabets Proc. 38th Ann. Symp. Found. Comput. Sci. 1997 137 143
5. D. Gusfield Algorithms on Strings, Trees, and Sequences Computer Science and Computational Biology 1997 Cambridge University Press
6. T. Kida, Y. Shibata, M. Takeda, A. Shinohara, S. Arikawa, Collage system: a unifying framework for compressed pattern matching, Theoret. Comput. Sci., submitted for publication
7. J.C. Kieffer, and E.-H. Yang Grammar-based codes: a new class of universal lossless source codes IEEE Trans. Inform. Theory 46 3 2000 737 754
8. J.C. Kieffer, E.-H. Yang, G. Nelson, and P. Cosman Universal lossless compression via multilevel pattern matching IEEE Trans. Inform. Theory 46 4 2000 1227 1245
9. D. Knuth Seminumerical Algorithms 1981 Addison-Wesley pp. 441-462
10. N.J. Larsson, and A. Moffat Offline dictionary-based compression Proc. IEEE 88 11 2000 1722 1732
11. E. Lehman, Approximation algorithms for grammar-based compression, PhD Thesis, MIT, 2002
12. E. Lehman, and A. Shelat Approximation algorithms for grammar-based compression Proc. 20th Ann. ACM-SIAM Symp. Discrete Algorithms 2002 205 212
13. C. Nevill-Manning, and I. Witten Compression and explanation using hierarchical grammars Computer J. 40 23 1997 103 116
14. C. Nevill-Manning, and I. Witten Identifying hierarchical structure in sequences: a linear-time algorithm J. Artificial Intelligence Res. 7 1997 67 82
15. W. Rytter Application of Lempel-Ziv factorization to the approximation of grammar-based compression Proc. 13th Ann. Sympo. Combinatorial Pattern Matching 2002 20 31
16. H. Sakamoto A fully linear-time approximation algorithm for grammar-based compression Proc. 14th Ann. Symp. Combinatorial Pattern Matching 2003 348 360
17. J.A. Storer, and T.G. Szymanski The macromodel for data compression Proc. 10th Ann. Symp. Theory Comput. 1978 ACM Press, San Diego, CA 30 39
18. T.A. Welch A technique for high performance data compression IEEE Comput. 17 1984 8 19
19. E.-H. Yang, and J.C. Kieffer Efficient universal lossless data compression algorithms based on a greedy sequential grammar transform - part one: without context models IEEE Trans. Inform. Theory 46 3 2000 755 777
20. J. Ziv, and A. Lempel A universal algorithm for sequential data compression IEEE Trans. Inform. Theory 23 3 1977 337 349
21. J. Ziv, and A. Lempel Compression of individual sequences via variable-rate coding IEEE Trans. Inform. Theory 24 5 1978 530 536