36 citations · 78 across the 32 of their papers we have counts for
7 papers · 2 filters
Efficient Representation and Counting of Antipower Factors in Words
Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter +3
A -antipower (for ) is a concatenation of pairwise distinct words of the same length. The study of fragments of a word being antipowers was initiated by Fici et al.…
Faster Recovery of Approximate Periods over Edit Distance
Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter +3
The approximate period recovery problem asks to compute all of a given word of length : all primitive words () which have a pe…
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…
On Abelian Longest Common Factor with and without RLE
Szymon Grabowski, Tomasz Kociumaka, Jakub Radoszewski
We consider the Abelian longest common factor problem in two scenarios: when input strings are uncompressed and are of size , and when the input strings are run-length encoded a…
Longest Common Substring Made Fully Dynamic
Amihood Amir, Panagiotis Charalampopoulos, Solon P. Pissis +1
In the longest common substring (LCS) problem, we are given two strings and , each of length at most , and we are asked to find a longest string occurring as a fragment o…
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…