5 papers
On the cyclic regularities of strings
Oluwole Ajala, Miznah Alshammary, Mai Alzamel +5
Regularities in strings are often related to periods and covers, which have extensively been studied, and algorithms for their efficient computation have broad application. In this…
Quasi-Linear-Time Algorithm for Longest Common Circular Factor
Mai Alzamel, Maxime Crochemore, Costas S. Iliopoulos +6
We introduce the Longest Common Circular Factor (LCCF) problem in which, given strings and of length , we are to compute the longest factor of whose cyclic shift occ…
How to answer a small batch of RMQs or LCA queries in practice
Mai Alzamel, Panagiotis Charalampopoulos, Costas S. Iliopoulos +1
In the Range Minimum Query (RMQ) problem, we are given an array of numbers and we are asked to answer queries of the following type: for indices and between and…
Faster algorithms for 1-mappability of a sequence
Mai Alzamel, Panagiotis Charalampopoulos, Costas S. Iliopoulos +3
In the k-mappability problem, we are given a string x of length n and integers m and k, and we are asked to count, for each length-m factor y of x, the number of other factors of l…
Palindromic Decompositions with Gaps and Errors
Michał Adamczyk, Mai Alzamel, Panagiotis Charalampopoulos +2
Identifying palindromes in sequences has been an interesting line of research in combinatorics on words and also in computational biology, after the discovery of the relation of pa…