36 citations · 92 across the 24 of their papers we have counts for
4 papers · 1 filter
Tight Bound for the Number of Distinct Palindromes in a Tree
Paweł Gawrychowski, Tomasz Kociumaka, Wojciech Rytter +1
For an undirected tree with edges labelled by single letters, we consider its substrings, which are labels of the simple paths between pairs of nodes. We prove that there are $…
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…
The Number of Repetitions in 2D-Strings
Panagiotis Charalampopoulos, Jakub Radoszewski, Wojciech Rytter +2
The notions of periodicity and repetitions in strings, and hence these of runs and squares, naturally extend to two-dimensional strings. We consider two types of repetitions in 2D-…
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…