Data compression with long repeated strings

Information Sciences

Volumn 135, Issue 1-2, 2001, Pages 1-11

  Bentley, Jon ^a   McIlroy, Douglas ^b  

^a LUCENT TECHNOLOGIES   (United States)

^b Dartmouth College   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; DATA REDUCTION; DATA STRUCTURES; ENCODING (SYMBOLS);

LEMPEL-ZIV METHODS; REPEATED STRINGS;

DATA COMPRESSION;

EID: 0035367637     PISSN: 00200255     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0255(01)00097-4     Document Type: Article

References (13)

1. A corpus for the evaluation of lossless compression algorithms
2. On finding duplication and near-duplication in large software systems
3. Unbounded length contexts for PPM
4. Efficient randomized pattern-matching algorithms
5. Suffix arrays: A new method for on-line string searches
6. A space-economical suffix tree construction algorithm
7. Identifying hierarchical structure in sequences: A linear-time algorithm
8. Data compression via textual substitution
9. Printed English compression by dictionary encoding
10. A universal algorithm for sequential data compression
11. Compression of individual sequences via variable-rate encoding