1 citations · 1 across the 5 of their papers we have counts for
4 papers · 1 filter
V-Words, Lyndon Words and Galois Words
Jacqueline W. Daykin, Neerja Mhaskar, W. F. Smyth
We say that a family of strings over forms a Unique Maximal Factorization Family (UMFF) if and only if every has a unique maximal factorizat…
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…
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…
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…