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 …

This book presents topics in discrete biomathematics, by promoting and exploring new
approaches at the borders between biology and discrete mathematics. Its main claim is that …

Sequence comparison is a prerequisite to virtually all comparative genomic analyses. It is
often realised by sequence alignment techniques, which are computationally expensive …

An extended special factor of a word x is a factor of x whose longest infix can be extended by
at least two distinct letters to the left or to the right and still occur in x. It is called extended …

We extend the theory of minimal absent words to (rooted and unrooted) trees, having edges
labeled by letters from an alphabet\varSigma of cardinality σ. We show that the set MAW (T) …

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 …

Background In the post-genomic era several methods of computational genomics are
emerging to understand how the whole information is structured within genomes. Literature …

Trapezoidal words are finite words having at most n+ 1 distinct factors of length n, for every
n>= 0. They encompass finite Sturmian words. We distinguish trapezoidal words into two …

Background An absent word with respect to a sequence is a word that does not occur in the
sequence as a factor; an absent word is minimal if all its factors on the other hand occur in …

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 …