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
S. Winograd
Journal of the ACM
Rama Akkiraju, Pinar Keskinocak, et al.
Applied Intelligence
Conference paper
The bionic DBMS is coming, but what will it look like?
Ryan Johnson, Ippokratis Pandis
CIDR 2013