Two decades ago, a breakthrough in indexing string collections made it possible to
represent them within their compressed space while at the same time offering indexed …

Unlike in statistical compression, where Shannon's entropy is a definitive lower bound, no
such clear measure exists for the compressibility of repetitive sequences. Since statistical …

We describe the first self-indexes able to count and locate pattern occurrences in optimal
time within a space bounded by the size of the most popular dictionary compressors. To …

Two recent lower bounds on the compressibility of repetitive sequences, δ≤ γ, have
received much attention. It has been shown that a length-n string S over an alphabet of size …

We consider the problem of computing the Maximal Exact Matches (MEMs) of a given
pattern $ P [1.. m] $ on a large repetitive text collection $ T [1.. n] $, which is represented as a …

While the th order empirical entropy is an accepted measure of the compressibility of
individual sequences on classical text collections, it is useful only for small values of and …

Measuring sequence similarity and compressing texts are among the most fundamental
tasks in string algorithms. In this work, we develop near-optimal quantum algorithms for the …

We show that the size γ (t_n) of the smallest string attractor of the n-th Thue-Morse word t_n
is 4 for any n ≥ 4, disproving the conjecture by Mantaci et al. ICTCS 2019 that it is n. We …

Abstract The Lempel-Ziv (LZ77) factorization of a string is a widely-used algorithmic tool that
plays a central role in data compression and indexing. For a length-n string over integer …

Function layout, also known as function reordering or function placement, is one of the most
effective profile-guided compiler optimizations. By reordering functions in a binary, compilers …