Partial words, which are sequences that may have some undefined positions called holes, can be viewed as sequences over an extended alphabet A = A ∪ { }, where stands for a hol...
Background: The number of k-words shared between two sequences is a simple and effcient alignment-free sequence comparison method. This statistic, D2, has been used for the cluste...
Duplication is an operation generating a language from a single word by iterated application of rewriting rules u uu on factors. We extend this operation to entire languages and i...
Masami Ito, Peter Leupold, Kayoko Shikishima-Tsuji
We propose an algorithm that given as input a full word w of length n, and positive integers p and d, outputs (if any exists) a maximal p-periodic partial word contained in w with ...
Francine Blanchet-Sadri, Robert Mercas, Abraham Ra...