12 citations · 16 across the 8 of their papers we have counts for
Showing 2015 · cs.DSShow all
2 papers · 2 filters
cs.DS2015★ 3 cited
A Note on Easy and Efficient Computation of Full Abelian Periods of a Word
Gabriele Fici, Thierry Lecroq, Arnaud Lefebvre +2
Constantinescu and Ilie (Bulletin of the EATCS 89, 167-170, 2006) introduced the idea of an Abelian period with head and tail of a finite word. An Abelian period is called full if…
cs.DS2015★ 1 cited
Fast Computation of Abelian Runs
Gabriele Fici, Tomasz Kociumaka, Thierry Lecroq +2
Given a word and a Parikh vector , an abelian run of period in is a maximal occurrence of a substring of having abelian period .…