Linear Algorithm for Data Compression via String Matching
Michael Rodeh, Vaughan Pratt, Shimon Even · Journal of the ACM · 1981
A linear implementation of the optimal universal data compression methods of Lempel and Ziv is described.The main tool is McCreight's algorithm for constructing suffix trees.Both bounded and unbounded memory are considered.
Cited by 225 works. doi:10.1145/322234.322237 Open-access PDF
Authors
References
- The Design and Analysis of Computer Algorithms
- A universal algorithm for sequential data compression
- Compression of individual sequences via variable-rate coding
- Linear pattern matching algorithms
- A Space-Economical Suffix Tree Construction Algorithm
- On the Complexity of Finite Sequences
- Universal codeword sets and representations of the integers
- Economical encoding of commas between strings
- A fast test for unique decipherability based on suffix trees (Corresp.)