Yehuda Naveli, Michal Rimon, et al.
AAAI/IAAI 2006
Paper
Linear Algorithm for Data Compression via String Matching
Abstract
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. © 1981, ACM. All rights reserved.
Related
Cristina Cornelio, Judy Goldsmith, et al.
JAIR
P. Trespeuch, Y. Fournier, et al.
Civil-Comp Proceedings
Arnold L. Rosenberg
Journal of the ACM