3 papers
cs.DS2021
Hardness of Detecting Abelian and Additive Square Factors in Strings
Jakub Radoszewski, Wojciech Rytter, Juliusz Straszyński +2
We prove 3SUM-hardness (no strongly subquadratic-time algorithm, assuming the 3SUM conjecture) of several problems related to finding Abelian square and additive square factors in…
cs.DS2020
Internal Quasiperiod Queries
Maxime Crochemore, Costas Iliopoulos, Jakub Radoszewski +4
Internal pattern matching requires one to answer queries about factors of a given string. Many results are known on answering internal period queries, asking for the periods of a g…
cs.DS2020
Counting Distinct Patterns in Internal Dictionary Matching
Panagiotis Charalampopoulos, Tomasz Kociumaka, Manal Mohamed +5
We consider the problem of preprocessing a text of length and a dictionary in order to be able to efficiently answer queries , that is, gi…