
Substring Query Complexity of String Reconstruction
Suppose an oracle knows a string S that is unknown to us and we want to ...
read it

Substring Complexity in Sublinear Space
Shannon's entropy is a definitive lower bound for statistical compressio...
read it

Primitive Sets of Words
Given a (finite or infinite) subset X of the free monoid A^* over a fini...
read it

Generating a Gray code for prefix normal words in amortized polylogarithmic time per word
A prefix normal word is a binary word with the property that no substrin...
read it

Minimal Absent Words in Rooted and Unrooted Trees
We extend the theory of minimal absent words to (rooted and unrooted) tr...
read it

Constructing Antidictionaries in OutputSensitive Space
A word x that is absent from a word y is called minimal if all its prope...
read it

Abelian AntiPowers in Infinite Words
An abelian antipower of order k (or simply an abelian kantipower) is ...
read it

On kMaximal Submonoids, with Applications in Combinatorics on Words
We define the notion of a kmaximal submonoid. A submonoid M is kmaxima...
read it

Alignmentfree sequence comparison using absent words
Sequence comparison is a prerequisite to virtually all comparative genom...
read it

On Prefix Normal Words
We present a new class of binary words: the prefix normal words. They ar...
read it

Algorithms for AntiPowers in Strings
A string S[1,n] is a power (or tandem repeat) of order k and period n/k ...
read it
Gabriele Fici
is this you? claim profile