2 citations · 6 across the 23 of their papers we have counts for
5 papers · 1 filter
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-…
Pattern Masking for Dictionary Matching
Panagiotis Charalampopoulos, Huiping Chen, Peter Christen +4
In the Pattern Masking for Dictionary Matching (PMDM) problem, we are given a dictionary of strings, each of length , a query string of length , a…
Dynamic Longest Common Substring in Polylogarithmic Time
Panagiotis Charalampopoulos, Paweł Gawrychowski, Karol Pokorski
The longest common substring problem consists in finding a longest string that appears as a (contiguous) substring of two input strings. We consider the dynamic variant of this pro…
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…
Faster Approximate Pattern Matching: A Unified Approach
Panagiotis Charalampopoulos, Tomasz Kociumaka, Philip Wellnitz
Approximate pattern matching is a natural and well-studied problem on strings: Given a text , a pattern , and a threshold , find (the starting positions of) all substrings…