We consider several types of internal queries, that is, questions about fragments of a given
text specified in constant space by their locations in. Our main result is an optimal data …

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 …

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 …

This thesis is devoted to internal queries in texts, which ask to solve classic text-processing
problems for substrings of a given text. More precisely, the task is to preprocess a static …

We present an improved wavelet tree construction algorithm and discuss its applications to a
number of rank/select problems for integer keys and strings. Given a string of length n over …

Fast construction of wavelet trees - ScienceDirect Skip to main contentSkip to article
Elsevier logo Journals & Books Search RegisterSign in View PDF Download full issue …

Abstract Kubica et al.[33] and Kim et al.[29] introduced order-preserving pattern matching: for
a given text the goal is to find its factors having the same 'shape'as a given pattern. Known …

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 …

Under the word RAM model, we design three data structures that can be constructed in $ O
(n\sqrt {\lg n}) $ time over $ n $ points in an $ n\times n $ grid. The first data structure is 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 …