Zhikun Yuen, Paula Branco, et al.
DSAA 2023
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
Shyam Marjit, Harshit Singh, et al.
WACV 2025
Ken C.L. Wong, Satyananda Kashyap, et al.
Pattern Recognition Letters
Rie Kubota Ando
CoNLL 2006