Linear Algorithm for Data Compression via String Matching 论文
1981Journal of the ACM引用 227
Algorithms and Data CompressionNetwork Packet Processing and Optimizationsemigroups and automata theory
摘要
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.