The notions of periodicity and repetitions in strings, and hence these of runs and squares,
naturally extend to two-dimensional strings. We consider two types of repetitions in 2D …

We consider the problem of preprocessing a text $ T $ of length $ n $ and a dictionary
$\mathcal {D} $ in order to be able to efficiently answer queries $ CountDistinct (i, j) $, that is …

This thesis is devoted to algorithms and data structures for classical problems in stringology
in the internal and dynamic settings. In the internal setting, the task is to preprocess a string …

We give a probabilistic analysis of parameters related to alpha-gapped repeats and
palindromes in random words, under both uniform and memoryless distributions (where …

In this article we propose an alternative way to prove some recent results on statistics on
words, such as the expected number of runs or the expected sum of the run exponents. Our …

A maximal repetition is a non-extendable (with the same period) periodic segment in a
string, in which the period repeats at least twice. In this paper we study problems related to …