Bemali Wickramanayake, Zhipeng He, et al.
Knowledge-Based Systems
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
Daniel Karl I. Weidele, Hendrik Strobelt, et al.
SysML 2019
Cristina Cornelio, Judy Goldsmith, et al.
JAIR
Arthur Nádas
IEEE Transactions on Neural Networks