3 citations · 3 across the 3 of their papers we have counts for
3 papers
Identifying all abelian periods of a string in quadratic time and relevant problems
Michalis Christou, Maxime Crochemore, Costas S. Iliopoulos
Abelian periodicity of strings has been studied extensively over the last years. In 2006 Constantinescu and Ilie defined the abelian period of a string and several algorithms for t…
Quasiperiodicities in Fibonacci strings
Michalis Christou, Maxime Crochemore, Costas Iliopoulos
We consider the problem of finding quasiperiodicities in a Fibonacci string. A factor u of a string y is a cover of y if every letter of y falls within some occurrence of u in y. A…
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…