3 papers
cs.DS2019
Constructing Antidictionaries in Output-Sensitive Space
Lorraine A. K. Ayad, Golnaz Badkobeh, Gabriele Fici +2
A word that is absent from a word is called minimal if all its proper factors occur in . Given a collection of words 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…
cs.DS2018
Longest Common Prefixes with -Errors and Applications
Lorraine A. K. Ayad, Panagiotis Charalampopoulos, Costas S. Iliopoulos +1
Although real-world text datasets, such as DNA sequences, are far from being uniformly random, average-case string searching algorithms perform significantly better than worst-case…