Thierry Lecroq

Fast Multiple Pattern Cartesian Tree Matching

2019 · arXiv (Cornell University)

Cartesian tree matching is the problem of finding all substrings in a given text which have the same Cartesian trees as that of a given pattern. In this paper, we deal with Cartesian tree matching …