Sciweavers

7 search results - page 1 / 2
» On the number of balanced words of given length and height o...
Sort
View
DMTCS
2010
109views Mathematics» more  DMTCS 2010»
13 years 2 months ago
On the number of balanced words of given length and height over a two letter alphabet
Nicolas Bedaride, Eric Domenjoud, Damien Jamet, Je...
DAM
2011
13 years 7 days ago
On minimal Sturmian partial words
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...
Francine Blanchet-Sadri, John Lensmire
BMCBI
2006
141views more  BMCBI 2006»
13 years 5 months ago
Asymptotic behaviour and optimal word size for exact and approximate word matches between random sequences
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...
Sylvain Forêt, Miriam R. Kantorovitz, Conrad...
DLT
2006
13 years 6 months ago
Closure of Language Classes Under Bounded Duplication
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
LATA
2009
Springer
14 years 1 days ago
An Answer to a Conjecture on Overlaps in Partial Words Using Periodicity Algorithms
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...