9 citations · 16 across the 10 of their papers we have counts for
5 papers · 1 filter
On the number of gapped repeats with arbitrary gap
Roman Kolpakov
For any functions , from to we call repeats such that as {\it -gapped repeats}. We study the possible…
Optimal searching of gapped repeats in a word
Maxime Crochemore, Roman Kolpakov, Gregory Kucherov
Following (Kolpakov et al., 2013; Gawrychowski and Manea, 2015), we continue the study of {\em -gapped repeats} in strings, defined as factors with . Our ma…
Searching of gapped repeats and subrepetitions in a word
Roman Kolpakov, Mikhail Podolskiy, Mikhail Posypkin +1
A gapped repeat is a factor of the form where and are nonempty words. The period of the gapped repeat is defined as . The gapped repeat is maximal if it cann…
On the number of Dejean words over alphabets of 5, 6, 7, 8, 9 and 10 letters
Roman Kolpakov, Michael Rao
We give lower bounds on the growth rate of Dejean words, i.e. minimally repetitive words, over a k-letter alphabet, for k=5, 6, 7, 8, 9, 10. Put together with the known upper bound…
On primary and secondary repetitions in words
Roman Kolpakov
Combinatorial properties of maximal repetitions (runs) in formal words are studied. We classify all maximal repetitions in a word as primary and secondary where the set of all prim…