Hagen Soltau, Lidia Mangu, et al.
ASRU 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
Ankit Vishnubhotla, Charlotte Loh, et al.
NeurIPS 2023
Robert Farrell, Rajarshi Das, et al.
AAAI-SS 2010
Rie Kubota Ando
CoNLL 2006