Some theory and practice of greedy off-line textual substitution

Data Compression Conference Proceedings

Volumn , Issue , 1998, Pages 119-128

  Apostolico, Alberto ^a   Lonardi, Stefano ^a  

^a PURDUE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CALCULATIONS; DATA STRUCTURES; ENCODING (SYMBOLS); HIERARCHICAL SYSTEMS; STATISTICS; TREES (MATHEMATICS);

DYNAMIC HUFFMAN ENCODING; GREEDY OFF LINE TEXTUAL SUBSTITUTION; MINIMAL AUGMENTED SUFFIX TREE; STANDARD TEMPLATE LIBRARY; SUBSTRING;

DATA COMPRESSION;

EID: 0031675019     PISSN: 10680314     EISSN: None     Source Type: None    
DOI: 10.1109/DCC.1998.672138     Document Type: Conference Paper

References (16)

1. A. Apostolico A. F. Fraenkel Robust transmission of unbounded strings using fibonacci representations IEEE Transactions on Information Theory 33 2 238 245 1987
2. A. Apostolico F. P. Preparata Data structures and algorithms for the strings stastitics problem Algorithmica 15 5 481 494 May 1996
3. A. Apostolico W. Szpankowski Self-alignment in words and their applications J. Algorithms 13 3 446 467 1992
4. T. C. Bell J. G. Cleary I. H. Witten Text Compression 1990 Prentice Hall
5. M. Burrows D. J. Wheeler A block-sorting lossless data compression algorithm TR Digital Equipments Corporation 124 May 1994
6. M. Cohn R. Khazan Parsing with suffix and prefix dictionaries DCC: Data Compression Conference 180 189 DCC: Data Compression Conference 1996
7. M. Crochemore W. Rytter Efficient parallel algorithms to test square-freeness and factorize strings Inform. Process. Lett. 38 57 60 1991
8. S. DeAgostino J. A. Storer On-line versus off-line computation in dynamic text compression Inform. Process. Lett. 59 3 169 174 1996
9. U. Manber G. Myers Suffix arrays: A new method for on-line string searches SIAM Journal on Computing 22 1993
10. E. M. McCreight A space-economical suffix tree construction algorithm Journal of the ACM 23 2 262 272 April 1976
11. C. Neville-Manning I. H. Witten D. Maulsby Compression by induction of hierarchical grammars DCC: Data Compression Conference 244 253 DCC: Data Compression Conference 1994
12. J. A. Storer Data Compression: Methods and Theory 1988 Computer Science Press
13. E. Ukkonen On-line construction of suffix trees Algorithmica 14 3 249 260 1995
14. I. H. Witten R. M. Neal J. G. Cleary Arithmetic coding for data compression Communications of the ACM 30 6 520 540 June 1987
15. J. Ziv A. Lempel A universal algorithm for sequential data compression IEEE Trans. on Inform. Theory IT-23 3 337 May 1977
16. J. Ziv A. Lempel Compression of individual sequences via variable-rate coding IEEE Trans. on Inform. Theory 24 5 September 1978