The rise of repetitive datasets has lately generated a lot of interest in compressed self-
indexes based on dictionary compression, a rich and heterogeneous family of techniques …

A Longest Common Extension (LCE) query on a text $ T $ of length $ N $ asks for the length
of the longest common prefix of suffixes starting at given two positions. 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 consider two closely related problems of text indexing in a sub-linear working space.
The first problem is the Sparse Suffix Tree (SST) construction, where a text S is given in read …

For a text T [1, n], a Longest Common Extension (LCE) query lce_T (i, j) asks for the length of
the longest common prefix of the suffixes T [i, n] and T [j, n] identified by their starting …

Given two positions $ i $ and $ j $ in a string $ T $ of length $ N $, a longest common
extension (LCE) query asks for the length of the longest common prefix between suffixes …

Longest common extension queries (often called longest common prefix queries) constitute
a fundamental building block in multiple string algorithms, for example computing runs and …

Suffix tree (and the closely related suffix array) are fundamental structures capturing all
substrings of a given text essentially by storing all its suffixes in the lexicographical order. In …

We study the Longest Common Extension (LCE) problem in a string containing wildcards.
Wildcards (also called" don't cares" or" holes") are special characters that match any other …

Given a string T of length n over an alphabet Σ⊂{1, 2,…, n O (1)} of size σ, we are to
preprocess T so that given a range [i, j], we can return a representation of a shortest string …