8 search results - page 1 / 2 » Understanding maximal repetitions in strings |
CORR
2008
Springer
13 years 11 months ago
2008
Springer
The cornerstone of any algorithm computing all repetitions in a string of length n in O(n) time is the fact that the number of runs (or maximal repetitions) is O(n). We give a simp...
JCSS
2008
13 years 10 months ago
2008
The cornerstone of any algorithm computing all repetitions in strings of length n in O(n) time is the fact that the number of maximal repetitions (runs) is linear. Therefore, the ...
IJFCS
2010
13 years 9 months ago
2010
Abstract. We show a Θ(n log n) bound on the maximal number of occurrences of primitively-rooted k-th powers occurring in a string of length n for any integer k, k ≥ 2. We also s...
SIAMDM
2010
13 years 9 months ago
2010
In this paper we study the problem of finding maximally sized subsets of binary strings (codes) of equal length that are immune to a given number r of repetitions, in the sense th...
IWOCA
2009
Springer
14 years 3 months ago
2009
Springer
We investigate the problem of the maximum number of cubic subwords (of the form www) in a given word. We also consider square subwords (of the form ww). The problem of the maximum ...