1 citations · 1 across the 2 of their papers we have counts for
3 papers
cs.DS2018
Enhanced string factoring from alphabet orderings
Amanda Clare, Jacqueline W. Daykin
In this note we consider the concept of alphabet ordering in the context of string factoring. We propose a greedy-type algorithm which produces Lyndon factorizations with small num…
cs.DS2017
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…
cs.DS2015★ 1 cited
Linear Algorithms for Computing the Lyndon Border Array and the Lyndon Suffix Array
Ali Alatabbi, Jacqueline W. Daykin, M. Sohel Rahman
We consider the problem of finding repetitive structures and inherent patterns in a given string $\s{s}$ of length over a finite totally ordered alphabet. A border $\s{u}$ of a…