36 citations · 92 across the 24 of their papers we have counts for
5 papers · 1 filter
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…
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…
String Periods in the Order-Preserving Model
Garance Gourdel, Tomasz Kociumaka, Jakub Radoszewski +3
The order-preserving model (op-model, in short) was introduced quite recently but has already attracted significant attention because of its applications in data analysis. We intro…
On Periodicity Lemma for Partial Words
Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter +1
We investigate the function , called here the threshold function, related to periodicity of partial words (words with holes). The value is defined as the minim…