12 citations · 16 across the 7 of their papers we have counts for
7 papers
Efficient pattern matching in degenerate strings with the Burrows-Wheeler transform
Jacqueline W. Daykin, Richard Groult, Yannick Guesnet +6
A degenerate or indeterminate string on an alphabet is a sequence of non-empty subsets of . Given a degenerate string of length , we present a new method based on the…
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…
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 .…
Abelian Powers and Repetitions in Sturmian Words
Gabriele Fici, Alessio Langiu, Thierry Lecroq +4
Richomme, Saari and Zamboni (J. Lond. Math. Soc. 83: 79-95, 2011) proved that at every position of a Sturmian word starts an abelian power of exponent for every . We imp…
Online Computation of Abelian Runs
Gabriele Fici, Thierry Lecroq, Arnaud Lefebvre +1
Given a word and a Parikh vector , an abelian run of period in is a maximal occurrence of a substring of having abelian period .…
Algorithms for Computing Abelian Periods of Words
Gabriele Fici, Thierry Lecroq, Arnaud Lefebvre +1
Constantinescu and Ilie (Bulletin EATCS 89, 167--170, 2006) introduced the notion of an \emph{Abelian period} of a word. A word of length over an alphabet of size can have…
Abelian Repetitions in Sturmian Words
Gabriele Fici, Alessio Langiu, Thierry Lecroq +3
We investigate abelian repetitions in Sturmian words. We exploit a bijection between factors of Sturmian words and subintervals of the unitary segment that allows us to study the p…