3 papers
cs.DS2026
Approximate Cartesian Tree Matching with Substitutions
Panagiotis Charalampopoulos, Jonas Ellert, Manal Mohamed
The Cartesian tree of a sequence captures the relative order of the sequence's elements. In recent years, Cartesian tree matching has attracted considerable attention, particularly…
cs.DS2025
Counting Distinct Square Substrings in Sublinear Time
Panagiotis Charalampopoulos, Manal Mohamed, Jakub Radoszewski +3
We show that the number of distinct squares in a packed string of length over an alphabet of size can be computed in time in the word-RAM model. This paper i…
cs.DS2025
Resilient Pattern Mining
Pengxin Bian, Panagiotis Charalampopoulos, Lorraine A. K. Ayad +3
Frequent pattern mining is a flagship problem in data mining. In its most basic form, it asks for the set of substrings of a given string of length that occur at least …