An absent factor of a string w is a string u which does not occur as a contiguous substring
(aka factor) inside w. We extend this well-studied notion and define absent subsequences: a …

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 …

An absent factor of a string w is a string u which does not occur as a contiguous substring
(aka factor) inside w. We extend this well-studied notion and define absent subsequences: a …

We introduce the notion of reverse-safe data structures. These are data structures that
prevent the reconstruction of the data they encode (ie, they cannot be easily reversed). A …

A word x that is absent from a word y is called minimal if all its proper factors occur in y.
Given a collection of k words y 1,…, yk over an alphabet Σ, we are asked to compute the set …

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

Shannon's entropy is a definitive lower bound for statistical compression. Unfortunately, no
such clear measure exists for the compressibility of repetitive strings. Thus, ad hoc measures …

In this overview, I present chronologically the published articles to which I contributed during
my doctoral studies. The papers that make up the chapters of this thesis, that is, Paper 1 [69] …

The growth in data volume has led to an increasing interest in analyzing data about
individuals in domains ranging from marketing to biomedical informatics. Therefore, data …

The main goal of this thesis is to develop new algorithmic frameworks to deal with (i) a
convenient representation of a set of similar genomes and (ii) phylogenetic data, with …