Simple linear-time off-line text compression by longest-first substitution

Data Compression Conference Proceedings

Volumn , Issue , 2007, Pages 123-132

  Nakamura, Eyosuke ^a   Bannai, Hideo ^a   Ineriaga, Shunsuke ^a   Takeda, Masayuki ^a,b  

^a KYUSHU UNIVERSITY   (Japan)

^b JAPAN SCIENCE AND TECHNOLOGY AGENCY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

SUFFIX TREES; TEXT COMPRESSION;

ALGORITHMS; CODES (SYMBOLS); DATA STRUCTURES; TREES (MATHEMATICS);

DATA COMPRESSION;

EID: 34547638395     PISSN: 10680314     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/DCC.2007.70     Document Type: Conference Paper

References (9)

1. A. Apostolico and S. Lonardi. Off-line compression by greedy textual substitution. Proc. IEEE, 88(11):1733-I744, 2000.
2. R. Arnold and T. Bell. A corpus for the evaluation of lossless compression algorithms. In Proc. Data Compression Conference '97 (DCC'97), pages 201-210, 1997.
3. J. Bentley and D. McIlroy. Data compression, using, long common strings. In Proc. Data Compression Conference '99 (DCC'99), pages 287-295. IEEE Computer Society, 1999.
4. S. Inenaga, T. Funamoto, M. Takeda, and A, Shinohara. Linear-time off-line text compression by longest-first substitution. In Proc. SPIRB'03, volume 2857 of LNCS, pages 137-152. Springe-Verlag, 2003.
5. J. Kärkkäinen and E. Ukkonen. Sparse suffix trees. In Proc. COCOON'96, volume 1090 of LNCS, pages 219-230. Springer-Verlag, 1996.
6. N. J. Larsson and A. Moffat. Offline dictionary-based compression. Prop. IEEE, 88:,(11):1722-1732, 2000.
7. C. G. Nevill-Manning; and I. H. Witten. Online and offline heuristics for inferring hierarchies of repetitions in sequences, Proc IEEE, 88(11):1745-1755, 2000.
8. J. Storer, NP-completeness Results Concerning Data Compression:, Technical report 234, Department of Electrical, Engineering and Computer Science, Princeton University, 1977.
9. E. Ukkonen. On-line construction of suffix trees. Algorithmica, 14(8):249-260, 1995.