Straight-line programs: A practical test

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

Volumn , Issue , 2011, Pages 76-81

  Burmistrov, Ivan ^a   Khvorost, Lesha ^a  

^a URAL FEDERAL UNIVERSITY   (Russian Federation)

Author keywords

AVL tree; LZ compression; straight line program

Indexed keywords

AVL-TREE; COMPARATIVE ANALYSIS; DATA SETS; IMPROVED ALGORITHM; LZ-COMPRESSION; PRACTICAL TESTS; STRAIGHT LINE PROGRAM; WORST CASE;

ALGORITHMS; COMMUNICATION; COMPRESSION RATIO (MACHINERY); FORESTRY; SOFTWARE TESTING; TREES (MATHEMATICS);

DATA COMPRESSION RATIO;

ALGORITHMS; COMMUNICATION; COMPUTER PROGRAMS; TESTING;

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

References (9)

1. A. Ishino, A. Shinohara, T. Nakamura, W. Matsubara, S. Inenaga, and K. Hashimoto. Computing longest common substring and all palindromes from compressed strings. In SOFSEM, volume 4910 of Lecture Notes in Computer Science, pages 364-375. Springer, 2008.
2. Y. Lifshits. Processing compressed texts: A tractability border. In CPM, volume 4580 of Lecture Notes in Computer Science, pages 228-240. Springer, 2007.
3. W. Rytter. Application of Lempel-Ziv factorization to the approximation of grammar-based compression. Theor. Comput. Sci., 302(1-3):211-222, 2003.
4. Y. Shibata, M. Takeda, A. Shinohara, T. Kida, T. Matsumoto, and S. Arikawa. Collage system: a unifying framework for compressed pattern matching. Theor. Comput. Sci., 1(298):253-272, 2003.
5. A. Shinohara, Y. Shibata, M. Takeda, and S. Arikawa. Pattern matching in text compressed by using antidictionaries. In CPM, volume 1645 of Lecture Notes in Computer Science, pages 37-49. Springer, 1999.
6. A. Tiskin. Faster subsequence recognition in compressed strings. CoRR, abs/0707.3407, 2007.
7. T. A. Welch. A technique for high-performance data compression. IEEE Computer, 17(6):8-19, 1984.
8. J. Ziv and A. Lempel. A universal algorithm for sequential data compression. IEEE Transactions on Information Theory, 23(3):337-343, 1977.
9. 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)