An online algorithm for lightweight grammar-based compression

Proceedings - 1st International Conference on Data Compression, Communication, and Processing, CCP 2011

Volumn , Issue , 2011, Pages 19-28

  Maruyama, Shirou ^a   Takeda, Masayuki ^a   Nakahara, Masaya ^b   Sakamoto, Hiroshi ^b  

^a KYUSHU UNIVERSITY   (Japan)

^b KYUSHU INSTITUTE OF TECHNOLOGY   (Japan)

Author keywords

approximation algorithm; grammar based compression; lossless compression; online algorithm

Indexed keywords

APPROXIMATION RATIOS; GRAMMAR-BASED COMPRESSION; LOSSLESS COMPRESSION; MAIN MEMORY; OFF-LINE ALGORITHM; ON-LINE ALGORITHMS; ONLINE VERSIONS; SPACE CONSUMPTION;

BINARY TREES; COMMUNICATION; COMPRESSION RATIO (MACHINERY); IMAGE COMPRESSION; LIFE CYCLE;

APPROXIMATION ALGORITHMS;

EID: 81255164860     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CCP.2011.40     Document Type: Conference Paper

References (20)

1. A. Apostolico and S. Lonardi. Offline compression by greedy textual substitution. Proc. IEEE, 88(11):1733-1744, 2000.
2. M. Burrows and D. Wheeler. A block sorting lossless data compression algorithm. Technical Report of Digital Equipment Corporation, 124, 1994.
3. M. Charikar, E. Lehman, D. Liu, R. Panigrahy, M. Prabhakaran, A. Sahai, and A. Shelat. The smallest grammar problem. IEEE Transactions on Information Theory, 51(7):2554-2576, 2005. (Pubitemid 41148951)
4. F. Claude and G. Navarro. Self-indexed text compression using straight-line programs. In MFCS'09, volume 5734 of LNCS, pages 235-246, 2009. to appear in Fundamenta Informaticae.
5. T. Gagie and P. Gawrychowski. Grammar-based compression in a streaming model. In LATA'10, volume 6031 of LNCS, pages 273-284, 2010.
6. D. Gusfield. Algorithms on Strings, Trees, and Sequences. Cambridge University Press, 1997.
7. R.M. Karp and M.O. Rabin. Efficient randomized pattern-matching algorithms. IBM Journal of Research and Development, 31(2):249-260, 1987.
8. T. Kida, T. Matsumoto, Y. Shibata, M. Takeda, A. Shinohara, and S. Arikawa. Collage systems: a unifying framework for compressed pattern matching. Theoret. Comput. Sci., 298(1):253-272, 2003.
9. J.C. Kieffer and E.-H. Yang. Grammar-based codes: A new class of universal lossless source codes. IEEE Transactions on Information Theory, 46(3):737-754, 2000.
10. N.J. Larsson and A. Moffat. Off-line dictionary-based compression. Proc. IEEE, 88(11):1722-1732, 2000. Announced at DCC 1999.
11. E. Lehman and A. Shelat. Approximation algorithms for grammar-based compression. In SODA'02, pages 205-212, 2002.
12. R. Nakamura, S. Inenaga, H. Bannai, T. Funamoto, M. Takeda, and A. Shinohara. Linear-time off-line text compression by longest-first substitution. Algorithms, 2(4):1429-1448, 2009.
13. C.G. Nevill-Manning and I.H. Witten. Identifying hierarchical strcture in sequences: A linear-time algorithm. J. Artif. Intell. Res., 7:67-82, 1997.
14. W. Rytter. Application of lempel-ziv factorization to the approximation of grammar-based compression. Theor. Comput. Sci., 302(1-3):211-222, 2003.
15. H. Sakamoto. A fully linear-time approximation algorithm for grammar-based compression. J. Discrete Algorithms, 3(2-4):416-430, 2005. (Pubitemid 40655189)
16. H. Sakamoto, T. Kida, and S. Shimozono. A space-saving linear-time algorithm for grammar-based compression. In SPIRE'04, volume 3246 of LNCS, pages 218-229, 2004.
17. H. Sakamoto, S. Maruyama, T. Kida, and S. Shimozono. A space-saving approximation algorithm for grammar-based compression. IEICE Trans. on Information and Systems, E92-D(2):158-165, 2009.
18. T. Welch. A technique for high-performance data compression. IEEE Computer, pages 8-19, June 1984.
19. J. Ziv and A. Lempel. A universal algorithm for sequential data compression. IEEE Transactions on Information Theory, 23(3):337-343, 1977.
20. J. Ziv and A. Lempel. Compression of individual sequences via variable-rate coding. IEEE Transactions on Information Theory, 24(5):530-536, 1978. (Pubitemid 8631609)