Showing cs.DSShow all
2 papers · 1 filter
cs.DS2011
Efficient Seeds Computation Revisited
Michalis Christou, Maxime Crochemore, Costas S. Iliopoulos +6
The notion of the cover is a generalization of a period of a string, and there are linear time algorithms for finding the shortest cover. The seed is a more complicated generalizat…
cs.DS2009
On the maximal number of highly periodic runs in a string
Maxime Crochemore, Costas Iliopoulos, Marcin Kubica +3
A run is a maximal occurrence of a repetition with a period such that . The maximal number of runs in a string of length was studied by several authors and…