Miao Guo, Yong Tao Pei, et al.
WCITS 2011
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
The bionic DBMS is coming, but what will it look like?
Ryan Johnson, Ippokratis Pandis
CIDR 2013
Shai Fine, Yishay Mansour
Machine Learning
Workshop paper
Extracting Verb Sense Hierarchies from FrameNet
Ran Iwamoto, Kyoko Ohara
ICLC 2023