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 …

Indexing highly repetitive texts—such as genomic databases, software repositories and
versioned text collections—has become an important problem since the turn of the …

A well-known fact in the field of lossless text compression is that high-order entropy is a
weak model when the input contains long repetitions. Motivated by this fact, decades of …

The last two decades have witnessed a dramatic increase in the amount of highly repetitive
datasets consisting of sequential data (strings, texts). Processing these massive amounts of …

Indexing highly repetitive texts—such as genomic databases, software repositories and
versioned text collections—has become an important problem since the turn of the …

Burrows–Wheeler transform (BWT) is an invertible text transformation that, given a text T of
length n, permutes its symbols according to the lexicographic order of suffixes of T. BWT is …

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 …

Background Sequencing technologies produce larger and larger collections of
biosequences that have to be stored in compressed indices supporting fast search …

In many real-world database systems, a large fraction of the data is represented by strings:
sequences of letters over some alphabet. This is because strings can easily encode data …

The Burrows-Wheeler Transform (BWT) has been an essential tool in text compression and
indexing. First introduced in 1994, it went on to provide the backbone for the first encoding of …