Cristina Cornelio, Judy Goldsmith, et al.
JAIR
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
Ken C.L. Wong, Satyananda Kashyap, et al.
Pattern Recognition Letters
Susan L. Spraragen
International Conference on Design and Emotion 2010
Salvatore Certo, Anh Pham, et al.
Quantum Machine Intelligence