2 citations · 3 across the 8 of their papers we have counts for
8 papers
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…
A visualization tool to explore alphabet orderings for the Burrows-Wheeler Transform
Lily Major, Dave Davies, Amanda Clare +3
The Burrows-Wheeler Transform (BWT) is an efficient invertible text transformation algorithm with the properties of tending to group identical characters together in a run, and ena…
Heuristics for the Run-length Encoded Burrows-Wheeler Transform Alphabet Ordering Problem
Lily Major, Amanda Clare, Jacqueline W. Daykin +2
The Burrows-Wheeler Transform (BWT) is a string transformation technique widely used in areas such as bioinformatics and file compression. Many applications combine a run-length en…
On Arithmetically Progressed Suffix Arrays and related Burrows-Wheeler Transforms
Jacqueline W. Daykin, Dominik Köppl, David Kübel +1
We characterize those strings whose suffix arrays are based on arithmetic progressions, in particular, arithmetically progressed permutations where all pairs of successive entries…
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…
String Comparison in -Order: New Lexicographic Properties & On-line Applications
Ali Alatabbi, Jacqueline W. Daykin, M. Sohel Rahman +1
-order is a global order on strings related to Unique Maximal Factorization Families (UMFFs), which are themselves generalizations of Lyndon words. -order has recently been p…
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…