7 citations · 13 across the 25 of their papers we have counts for
3 papers · 1 filter
A Note on Efficient Computation of All Abelian Periods in a String
Maxime Crochemore, Costas Iliopoulos, Tomasz Kociumaka +6
We derive a simple efficient algorithm for Abelian periods knowing all Abelian squares in a string. An efficient algorithm for the latter problem was given by Cummings and Smyth in…
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…