Abstract The Lempel-Ziv parsing of a string (LZ77 for short) is one of the most important and
widely-used algorithmic tools in data compression and string processing. We show that the …

Computing the LZ factorization (or LZ77 parsing) of a string is a computational bottleneck in
many diverse applications, including data compression, text indexing, and pattern discovery …

In this paper we present a really simple linear-time algorithm constructing a context-free
grammar of size 4 g log 3/2⁡(N/g) for the input string, where N is the size of the input string …

We present a new, simple, and efficient approach for computing the Lempel-Ziv (LZ77)
factorization of a string in linear time, based on suffix arrays. Computational experiments on …

In the 35 years since its discovery, the Lempel-Ziv factorization (or LZ77 parsing) has
become a fundamental method for data compression and string processing. In many …

We present a new linear time algorithm for computing the Lempel-Ziv Factorization (LZ77) of
a given string of length N on an alphabet of size σ, that utilizes only N log N+ O (σ log N) bits …

We consider the problem of maintaining the size of the LZ77 factorization of a string S of
length at most n under the following operations:(a) appending a given letter to S and (b) …

Abstract For decades the Lempel-Ziv (LZ77) factorization has been a cornerstone of data
compression and string processing algorithms, and uses for it are still being uncovered. For …

A palindromic factorization of a string w is a factorization of w consisting only of palindromic
substrings of w. In this paper, we present an on-line O (n log n)-time O (n)-space algorithm to …

Indexing text collections to support pattern matching queries is a fundamental problem in
computer science. New challenges keep arising as databases grow, and for repetitive …