7 citations · 13 across the 25 of their papers we have counts for
4 papers · 2 filters
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…
Efficient Computation of Sequence Mappability
Panagiotis Charalampopoulos, Costas S. Iliopoulos, Tomasz Kociumaka +3
In the -mappability problem, for a given sequence of length , the goal is to compute a table whose th entry is the number of indices such that the length…
Linear-Time Algorithm for Long LCF with Mismatches
Panagiotis Charalampopoulos, Maxime Crochemore, Costas S. Iliopoulos +5
In the Longest Common Factor with Mismatches (LCF) problem, we are given two strings and of total length , and we are asked to find a pair of maximal-length fact…
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…