We introduce LZ-End, a new member of the Lempel–Ziv family of text compressors, which
achieves compression ratios close to those of LZ77 but is much faster at extracting arbitrary …

Results on algorithmic problems on strings that are given in a compressed form via straight-
line programs are surveyed. A straight-line program is a context-free grammar that …

The rapid advance of DNA sequencing technologies has yielded databases of thousands of
genomes. To search and index these databases effectively, it is important that we take …

To store and search genomic databases efficiently, researchers have recently started
building compressed self-indexes based on straight-line programs and LZ77. In this paper …

To store and search genomic databases efficiently, researchers have recently started
building self-indexes based on LZ77. As the name suggests, a self-index for a string …

In this article, a fully compressed pattern matching problem is studied. The compression is
represented by straight-line programs (SLPs)—that is, context-free grammars generating …

We introduce the first grammar-compressed representation of a sequence that supports
searches in time that depends only logarithmically on the size of the grammar. Given a text T …

Given two strings, the longest common subsequence (LCS) problem consists in computing
the length of the longest string that is a subsequence of both input strings. Its generalisation …

Colored range queries are a well-studied topic in computational geometry and database
research that, in the past decade, have found exciting applications in information retrieval. In …

Recent advances in biotechnology and web technology are continuously generating huge
collections of similar strings. People now face the problem of storing them compactly while …