7 citations · 13 across the 25 of their papers we have counts for
4 papers · 2 filters
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…
Optimal Computation of Overabundant Words
Yannis Almirantis, Panagiotis Charalampopoulos, Jia Gao +4
The observed frequency of the longest proper prefix, the longest proper suffix, and the longest infix of a word in a given sequence can be used for classifying as avoid…
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…