Strings may be parsed either with respect to themselves-leading to universal data
compression algorithms [ZLl, ZL2, RPE]-or with respect to some reference dictionary. In this …

Linear Algorithm for Data Compression via String Matching Page 1 Linear Algorithm for Data
Compression via String Matching MICHAEL RODEH IBM Israel Scientific Center, Haifa, Israel …

We address the following issue: given a word w∈ A* and a set of n nonempty words X, how
does one determine efficiently whether w∈ X* or not? We discuss several methods …

In [4] a universal data compression algorithm (BW-algorithm, for short) is described which
achieves compression rates that are close to the best known rates achieved in practice. Due …

We initiate a new class of string matching problems called Substring Compression
Problems. Given a string S that may be preprocessed, the problem is to quickly find the …

The Ziv-Lempel compression algorithm is a string matching and parsing approach to data
compression. The symbolwise equivalent for parsing models has been defined by Rissanen …

We show that greedy left-to-right (right-to-left) parsing is optimal wrt a suffix (prefix)
dictionary. To exploit this observation, we show how to construct a static suffix dictionary that …

Textual substitution methods (often called “LZ” methods due to the work of Lempel and Ziv
[l]) parse a string in phruse. s and replace them with poinrers to copies, called targets of the …

The most common compression algorithms used in practice are the on-line dictionary
schemes. These algorithms are based on maintaining a dictionary of strings that are called …

Parallel algorithms for lossless data compression via dictionary compression using optimal,
longest fragment first (LFF), and greedy parsing strategies are described. Dictionary …