A space-saving linear-time algorithm for grammar-based compression

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3246, Issue , 2004, Pages 218-229

  Sakamoto, Hiroshi ^a   Kida, Takuya ^b   Shimozono, Shinichi ^a  

^a KYUSHU INSTITUTE OF TECHNOLOGY   (Japan)

^b HOKKAIDO UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION RATIOS; GRAMMAR-BASED COMPRESSION; LINEAR-TIME ALGORITHMS; LINEAR-TIME APPROXIMATION; SPACE EFFICIENT; SPACE SAVINGS; WORSTCASE;

APPROXIMATION ALGORITHMS; CLUSTERING ALGORITHMS; CONTEXT FREE GRAMMARS; DATA COMPRESSION;

CLUSTERING ALGORITHMS; ALGORITHMS;

EID: 84871057757     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30213-1_33     Document Type: Conference Paper

References (24)

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. Springer, 1999.
2. S. De Agostino and J. A. Storer. On-Line versus Off-Line Computation in Dynamic Text Compression. Inform. Process. Lett., 59:169-174, 1996.
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. In Proc. 29th Ann. Sympo. on Theory of Computing, 792-801, 2002.
4. M. Farach. Optimal Suffix Tree Construction with Large Alphabets. In Proc. 38th Ann. Sympo. on Foundations of Computer Science, 137-143, 1997.
5. D. Gusfield. Algorithms on Strings, Trees, and Sequences. Computer Science and Computational Biology. Cambridge University Press, 1997.
6. T. Kida, Y. Shibata, M. Takeda, A. Shinohara, and S. Arikawa. Collage System: a Unifying Framework for Compressed Pattern Matching. Theoret. Comput. Sci. (to appear).
7. J. C. Kieffer and E.-H. Yang. Grammar-Based Codes: a New Class of Universal Lossless Source Codes. IEEE Trans. on Inform. Theory, 46(3):737-754, 2000.
8. J. C. Kieffer, E.-H. Yang, G. Nelson, and P. Cosman. Universal Lossless Compression via Multilevel Pattern Matching. IEEE Trans. Inform. Theory, IT-46(4), 1227-1245, 2000.
9. D. Knuth. Seminumerical Algorithms. Addison-Wesley, 441-462, 1981.
10. N. J. Larsson and A. Moffat. Offline Dictionary-Based Compression. Proceedings of the IEEE, 88(11):1722-1732, 2000.
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. In Proc. 20th Ann. ACM-SIAM Sympo. on Discrete Algorithms, 205-212, 2002.
13. M. Lothaire. Combinatorics on Words, volume 17 of Encyclopedia of Mathematics and Its Applications. Addison-Wesley, 1983.
14. C. Nevill-Manning and I.Witten. Compression and Explanation Using Hierarchical Grammars. Computer Journal, 40(2/3):103-116, 1997.
15. C. Nevill-Manning and I. Witten. Identifying hierarchical structure in sequences: a linear-time algorithm. J. Artificial Intelligence Research, 7:67-82, 1997.
16. W. Rytter. Application of Lempel-Ziv Factorization to the Approximation of Grammar-Based Compression. In Proc. 13th Ann. Sympo. Combinatorial Pattern Matching, 20-31, 2002.
17. H. Sakamoto. A Fully Linear-Time Approximation Algorithm for Grammar-Based Compression. Journal of Discrete Algorithms, to appear.
18. D. Salomon. Data compression: the complete reference. Springer, second edition, 1998.
19. J. Storer and T. Szymanski. Data compression via textual substitution. J. Assoc. Comput. Mach., 29(4):928-951, 1982.
20. J. A. Storer and T. G. Szymanski. The Macro Model for Data Compression. In Proc. 10th Ann. Sympo. on Theory of Computing, pages 30-39, San Diego, California, 1978. ACM Press.
21. T. A. Welch. A Technique for High Performance Data Compression. IEEE Comput., 17:8-19, 1984.
22. 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. on Inform. Theory, 46(3):755-777, 2000.
23. J. Ziv and A. Lempel. A Universal Algorithm for Sequential Data Compression. IEEE Trans. on Inform. Theory, IT-23(3):337-349, 1977.
24. J. Ziv and A. Lempel. Compression of Individual Sequences via Variable-Rate Coding. IEEE Trans. on Inform. Theory, 24(5):530-536, 1978.