Lorraine A. K. Ayad

collaborators

5 papers

cs.DS2025

Resilient Pattern Mining

Pengxin Bian, Panagiotis Charalampopoulos, Lorraine A. K. Ayad +3

Frequent pattern mining is a flagship problem in data mining. In its most basic form, it asks for the set of substrings of a given string $S$ of length $n$ that occur at least $I ¨ $ …

cs.DS2025

U-index: A Universal Indexing Framework for Matching Long Patterns

Lorraine A. K. Ayad, Gabriele Fici, Ragnar Groot Koerkamp +4

Text indexing is a fundamental and well-studied problem. Classic solutions either replace the original text with a compressed representation, e.g., the FM-index and its variants, o…

cs.DS2024

Text Indexing for Long Patterns using Locally Consistent Anchors

Lorraine A. K. Ayad, Grigorios Loukides, Solon P. Pissis

In many real-world database systems, a large fraction of the data is represented by strings: sequences of letters over some alphabet. This is because strings can easily encode data…

cs.DS2024

Sparse Suffix and LCP Array: Simple, Direct, Small, and Fast

Lorraine A. K. Ayad, Grigorios Loukides, Solon P. Pissis +1

Sparse suffix sorting is the problem of sorting $b = o (n)$ suffixes of a string of length $n$ . Efficient sparse suffix sorting algorithms have existed for more than a decade. Despite…

cs.DS2024

Minimizing the Minimizers via Alphabet Reordering

Hilde Verbeek, Lorraine A. K. Ayad, Grigorios Loukides +1

Minimizers sampling is one of the most widely-used mechanisms for sampling strings [Roberts et al., Bioinformatics 2004]. Let $S = S [1] \dots S [n]$ be a string over a totally ordered…