36 citations · 78 across the 32 of their papers we have counts for
5 papers · 1 filter
Longest common substring with approximately mismatches
Tomasz Kociumaka, Jakub Radoszewski, Tatiana Starikovskaya
In the longest common substring problem, we are given two strings of length and must find a substring of maximal length that occurs in both strings. It is well known that the p…
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…
Indexing Weighted Sequences: Neat and Efficient
Carl Barton, Tomasz Kociumaka, Chang Liu +2
In a \emph{weighted sequence}, for every position of the sequence and every letter of the alphabet a probability of occurrence of this letter at this position is specified. Weighte…
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…
Two strings at Hamming distance 1 cannot be both quasiperiodic
Amihood Amir, Costas S. Iliopoulos, Jakub Radoszewski
We present a generalization of a known fact from combinatorics on words related to periodicity into quasiperiodicity. A string is called periodic if it has a period which is at mos…