Wojciech Rytter | DeepAI

DeepAI AI Chat

Featured Co-authors

Tomasz Kociumaka
49 publications
Paweł Gawrychowski
49 publications
Jakub Radoszewski
25 publications
Panagiotis Charalampopoulos
22 publications
Solon P. Pissis
22 publications
Tomasz Waleń
15 publications
Wiktor Zuba
12 publications
Juliusz Straszyński
9 publications
Maxime Crochemore
8 publications
Garance Gourdel
6 publications
Costas S. Iliopoulos
5 publications

∙ 08/18/2022

Approximate Circular Pattern Matching

We consider approximate circular pattern matching (CPM, in short) under ...

0 Panagiotis Charalampopoulos, et al. ∙

∙ 07/20/2021

Hardness of Detecting Abelian and Additive Square Factors in Strings

We prove 3SUM-hardness (no strongly subquadratic-time algorithm, assumin...

0 Jakub Radoszewski, et al. ∙

∙ 08/30/2020

Tight Bound for the Number of Distinct Palindromes in a Tree

For an undirected tree with n edges labelled by single letters, we consi...

0 Paweł Gawrychowski, et al. ∙

∙ 07/27/2020

Internal Quasiperiod Queries

Internal pattern matching requires one to answer queries about factors o...

0 Maxime Crochemore, et al. ∙

∙ 06/29/2020

The Number of Repetitions in 2D-Strings

The notions of periodicity and repetitions in strings, and hence these o...

0 Panagiotis Charalampopoulos, et al. ∙

∙ 05/12/2020

Counting Distinct Patterns in Internal Dictionary Matching

We consider the problem of preprocessing a text T of length n and a dict...

0 Panagiotis Charalampopoulos, et al. ∙

∙ 09/25/2019

Internal Dictionary Matching

We introduce data structures answering queries concerning the occurrence...

0 Panagiotis Charalampopoulos, et al. ∙

∙ 09/25/2019

Weighted Shortest Common Supersequence Problem Revisited

A weighted string, also known as a position weight matrix, is a sequence...

0 Panagiotis Charalampopoulos, et al. ∙

∙ 08/05/2019

On the cyclic regularities of strings

Regularities in strings are often related to periods and covers, which h...

0 Oluwole Ajala, et al. ∙

∙ 07/03/2019

Circular Pattern Matching with k Mismatches

The k-mismatch problem consists in computing the Hamming distance betwee...

0 Panagiotis Charalampopoulos, et al. ∙

∙ 03/26/2019

Syntactic View of Sigma-Tau Generation of Permutations

We give a syntactic view of the Sawada-Williams (σ,τ)-generation of perm...

0 Wojciech Rytter, et al. ∙

∙ 01/31/2019

Quasi-Linear-Time Algorithm for Longest Common Circular Factor

We introduce the Longest Common Circular Factor (LCCF) problem in which,...

0 Mai Alzamel, et al. ∙

∙ 12/19/2018

Efficient Representation and Counting of Antipower Factors in Words

A k-antipower (for k > 2) is a concatenation of k pairwise distinct word...

0 Tomasz Kociumaka, et al. ∙

∙ 07/27/2018

Faster Recovery of Approximate Periods over Edit Distance

The approximate period recovery problem asks to compute all approximate ...

0 Tomasz Kociumaka, et al. ∙

∙ 02/18/2018

Linear-Time Algorithm for Long LCF with k Mismatches

In the Longest Common Factor with k Mismatches (LCF_k) problem, we are g...

0 Panagiotis Charalampopoulos, et al. ∙

∙ 01/04/2018

String Periods in the Order-Preserving Model

The order-preserving model (op-model, in short) was introduced quite rec...

0 Garance Gourdel, et al. ∙

∙ 01/03/2018

On Periodicity Lemma for Partial Words

We investigate the function L(h,p,q), called here the threshold function...

0 Tomasz Kociumaka, et al. ∙

Are you a researcher?
Expose your work
to one of the largest
A.I. communities in the world