12 citations · 16 across the 7 of their papers we have counts for
4 papers · 1 filter
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 .…
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…