Bing Zhang, Mikio Takeuchi, et al.
NAACL 2025
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
Conference paper
Representing and Reasoning with Defaults for Learning Agents
Benjamin N. Grosof
AAAI-SS 1993
Ella Barkan, Ibrahim Siddiqui, et al.
Computational And Structural Biotechnology Journal
Pavel Klavík, A. Cristiano I. Malossi, et al.
Philos. Trans. R. Soc. A