Lorraine A. K. Ayad

activity

20182025

most citedText Indexing for Long Patterns using Locally Consistent Anchors

1 citations · 1 across the 5 of their papers we have counts for

collaborators

8 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 $τ$ …

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★ 1 cited

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

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…

cs.DS2023

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.DS2019

Constructing Antidictionaries in Output-Sensitive Space

Lorraine A. K. Ayad, Golnaz Badkobeh, Gabriele Fici +2

A word $x$ that is absent from a word $y$ is called minimal if all its proper factors occur in $y$ . Given a collection of $k$ words $y_{1}, y_{2}, \dots, y_{k}$ over an alphabet $Σ$ , we ar…

cs.DS2018

Longest Property-Preserved Common Factor

Lorraine A. K Ayad, Giulia Bernardini, Roberto Grossi +4

In this paper we introduce a new family of string processing problems. We are given two or more strings and we are asked to compute a factor common to all strings that preserves a…