7 citations · 11 across the 5 of their papers we have counts for
6 papers
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…
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…
Algorithms for Longest Common Abelian Factors
Ali Alatabbi, Costas S. Iliopoulos, Alessio Langiu +1
In this paper we consider the problem of computing the longest common abelian factor (LCAF) between two given strings. We present a simple time algorithm, where is…
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…