Lorraine A. K. Ayad

Orcid: 0000-0003-0846-2616

According to our database1, Lorraine A. K. Ayad authored at least 20 papers between 2016 and 2025.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
Text indexing for long patterns using locally consistent anchors.
VLDB J., September, 2025

U-Index: A Universal Indexing Framework for Matching Long Patterns.
Proceedings of the 23rd International Symposium on Experimental Algorithms, 2025

Resilient Pattern Mining.
Proceedings of the IEEE International Conference on Data Mining, 2025

2024
Sparse Suffix and LCP Array: Simple, Direct, Small, and Fast.
Proceedings of the LATIN 2024: Theoretical Informatics, 2024

Minimizing the Minimizers via Alphabet Reordering.
Proceedings of the 35th Annual Symposium on Combinatorial Pattern Matching, 2024

2023
Text Indexing for Long Patterns: Anchors are All you Need.
Proc. VLDB Endow., 2023

2021
Constructing Antidictionaries of Long Texts in Output-Sensitive Space.
Theory Comput. Syst., 2021

2020
Longest property-preserved common factor: A new string-processing framework.
Theor. Comput. Sci., 2020

Comparing Degenerate Strings.
Fundam. Informaticae, 2020

SMART: SuperMaximal approximate repeats tool.
Proceedings of the BCB '20: 11th ACM International Conference on Bioinformatics, 2020

2019
Efficient sequence comparison via combining alignment and alignment-free techniques: algorithms and bioinformatics research.
PhD thesis, 2019

Constructing Antidictionaries in Output-Sensitive Space.
Proceedings of the Data Compression Conference, 2019

2018
Longest Common Prefixes with k-Errors and Applications.
CoRR, 2018

CNEFinder: finding conserved non-coding elements in genomes.
Bioinform., 2018

Degenerate String Comparison and Applications.
Proceedings of the 18th International Workshop on Algorithms in Bioinformatics, 2018

Longest Property-Preserved Common Factor.
Proceedings of the String Processing and Information Retrieval, 2018

Longest Common Prefixes with k-Errors and Applications.
Proceedings of the String Processing and Information Retrieval, 2018

Longest Common Prefixes with k-Mismatches and Applications.
Proceedings of the SOFSEM 2018: Theory and Practice of Computer Science - 44th International Conference on Current Trends in Theory and Practice of Computer Science, Krems, Austria, January 29, 2018

2017
A faster and more accurate heuristic for cyclic edit distance computation.
Pattern Recognit. Lett., 2017

2016
libFLASM: a software library for fixed-length approximate string matching.
BMC Bioinform., 2016


  Loading...