Salvatore Certo, Anh Pham, et al.
Quantum Machine Intelligence
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
Guojing Cong, David A. Bader
Journal of Parallel and Distributed Computing
Hong-linh Truong, Maja Vukovic, et al.
ICDH 2024
Baihan Lin, Guillermo Cecchi, et al.
IJCAI 2023