Miao Guo, Yong Tao Pei, et al.
WCITS 2011
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
Saeel Sandeep Nachane, Ojas Gramopadhye, et al.
EMNLP 2024
Michael Hersche, Mustafa Zeqiri, et al.
NeSy 2023
Fearghal O'Donncha, Albert Akhriev, et al.
Big Data 2021