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 …

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

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 …

Motivated by challenges in pangenomic read alignment, we propose a generalization of
Wheeler graphs that we call Wheeler maps. A Wheeler map stores a text T [1.. n] and an …

The classic string indexing problem is to preprocess a string S into a compact data structure
that supports efficient pattern matching queries. Typical queries include existential queries …

A weighted sequence is a sequence of probability mass functions over a finite alphabet. A
weighted index is a data structure constructed for a weighted sequence and a threshold 1 z …

The suffix array, describing the lexicographical order of suffixes of a given text, and the suffix
tree, a path-compressed trie of all suffixes, are the two most fundamental data structures for …

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 …

In Gapped String Indexing, the goal is to compactly represent a string $ S $ of length $ n $
such that for any query consisting of two strings $ P_1 $ and $ P_2 $, called patterns, and an …