libFLASM: a software library for fixed-length approximate string matching. - Lorraine A. K. Ayad; Solon P. Pissis; Ahmad Retha (BMC Bioinform., 2016)

A faster and more accurate heuristic for cyclic edit distance computation. - Lorraine A. K. Ayad; Carl Barton; Solon P. Pissis (Pattern Recognit. Lett., 2017)

Longest Common Prefixes with k-Mismatches and Applications. - Hayam Alamro; Lorraine A. K. Ayad; Panagiotis Charalampopoulos; Costas S. Iliopoulos; Solon P. Pissis (SOFSEM, 2018)

Longest Common Prefixes with k-Errors and Applications. - Lorraine A. K. Ayad; Carl Barton; Panagiotis Charalampopoulos; Costas S. Iliopoulos; Solon P. Pissis (SPIRE, 2018)

Longest Property-Preserved Common Factor. - Lorraine A. K. Ayad; Giulia Bernardini 001; Roberto Grossi; Costas S. Iliopoulos; Nadia Pisanti; Solon P. Pissis; Giovanna Rosone (SPIRE, 2018)

Degenerate String Comparison and Applications. - Mai Alzamel; Lorraine A. K. Ayad; Giulia Bernardini 001; Roberto Grossi; Costas S. Iliopoulos; Nadia Pisanti; Solon P. Pissis; Giovanna Rosone (WABI, 2018)

CNEFinder: finding conserved non-coding elements in genomes. - Lorraine A. K. Ayad; Solon P. Pissis; Dimitris Polychronopoulos (Bioinform., 2018)

Longest Common Prefixes with k-Errors and Applications. - Lorraine A. K. Ayad; Panagiotis Charalampopoulos; Costas S. Iliopoulos; Solon P. Pissis (CoRR, 2018)

Constructing Antidictionaries in Output-Sensitive Space. - Lorraine A. K. Ayad; Golnaz Badkobeh; Gabriele Fici; Alice Héliou; Solon P. Pissis (DCC, 2019)

Efficient sequence comparison via combining alignment and alignment-free techniques: algorithms and bioinformatics research. - Lorraine A. K. Ayad (2019)

SMART: SuperMaximal approximate repeats tool. - Lorraine A. K. Ayad; Panagiotis Charalampopoulos; Solon P. Pissis (Bioinform., 2020)

Comparing Degenerate Strings. - Mai Alzamel; Lorraine A. K. Ayad; Giulia Bernardini 001; Roberto Grossi; Costas S. Iliopoulos; Nadia Pisanti; Solon P. Pissis; Giovanna Rosone (Fundam. Informaticae, 2020)

Longest property-preserved common factor: A new string-processing framework. - Lorraine A. K. Ayad; Giulia Bernardini 001; Roberto Grossi; Costas S. Iliopoulos; Nadia Pisanti; Solon P. Pissis; Giovanna Rosone (Theor. Comput. Sci., 2020)

Constructing Antidictionaries of Long Texts in Output-Sensitive Space. - Lorraine A. K. Ayad; Golnaz Badkobeh; Gabriele Fici; Alice Héliou; Solon P. Pissis (Theory Comput. Syst., 2021)

Text Indexing for Long Patterns: Anchors are All you Need. - Lorraine A. K. Ayad; Grigorios Loukides; Solon P. Pissis (Proc. VLDB Endow., 2023)

Minimizing the Minimizers via Alphabet Reordering. - Hilde Verbeek 001; Lorraine A. K. Ayad; Grigorios Loukides; Solon P. Pissis (CPM, 2024)

Sparse Suffix and LCP Array: Simple, Direct, Small, and Fast. - Lorraine A. K. Ayad; Grigorios Loukides; Solon P. Pissis; Hilde Verbeek 001 (LATIN (1), 2024)

U-Index: A Universal Indexing Framework for Matching Long Patterns. - Lorraine A. K. Ayad; Gabriele Fici; Ragnar Groot Koerkamp; Grigorios Loukides; Rob Patro; Giulio Ermanno Pibiri; Solon P. Pissis (SEA, 2025)

Resilient Pattern Mining. - Pengxin Bian; Panagiotis Charalampopoulos; Lorraine A. K. Ayad; Manal Mohamed 001; Solon P. Pissis; Grigorios Loukides (CoRR, 2025)

Text indexing for long patterns using locally consistent anchors. - Lorraine A. K. Ayad; Grigorios Loukides; Solon P. Pissis (VLDB J., 2025)