15 citations · 40 across the 14 of their papers we have counts for
9 papers · 1 filter
Practical KMP/BM Style Pattern-Matching on Indeterminate Strings
Hossein Dehghani, Neerja Mhaskar, W. F. Smyth
In this paper we describe two simple, fast, space-efficient algorithms for finding all matches of an indeterminate pattern in an indeterminate string , w…
A New Approach to Regular & Indeterminate Strings
Felipe A. Louza, Neerja Mhaskar, W. F. Smyth
In this paper we propose a new, more appropriate definition of regular and indeterminate strings. A regular string is one that is "isomorphic" to a string whose entries all consist…
Lyndon Array Construction during Burrows-Wheeler Inversion
Felipe A. Louza, W. F. Smyth, Giovanni Manzini +1
In this paper we present an algorithm to compute the Lyndon array of a string of length as a byproduct of the inversion of the Burrows-Wheeler transform of . Our algorit…
Algorithms to Compute the Lyndon Array
Frantisek Franek, A. S. M. Sohidull Islam, M. Sohel Rahman +1
We first describe three algorithms for computing the Lyndon array that have been suggested in the literature, but for which no structured exposition has been given. Two of these al…
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…
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…
Enhanced Covers of Regular & Indeterminate Strings using Prefix Tables
Ali Alatabbi, A. S. Sohidull Islam, M. Sohel Rahman +2
A \itbf{cover} of a string is a proper substring of such that can be constructed from possibly overlapping instances of . A recent paper \cite{FIKPPST1…
Inferring an Indeterminate String from a Prefix Graph
Ali Alatabbi, M. Sohel Rahman, W. F. Smyth
An \itbf{indeterminate string} (or, more simply, just a \itbf{string}) $\s{x} = \s{x}[1..n]$ on an alphabet is a sequence of nonempty subsets of . We say that $\s{x}[i_1]$ a…
Computing Covers Using Prefix Tables
Ali Alatabbi, M. Sohel Rahman, W. F. Smyth
An \emph{indeterminate string} on an alphabet is a sequence of nonempty subsets of ; is said to be \emph{regular} if every subset is of size one. A proper…