Showing cs.DSShow all
2 papers · 1 filter
cs.DS2019
Fast Multiple Pattern Cartesian Tree Matching
Geonmo Gu, Siwoo Song, Simone Faro +2
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 Cartesi…
cs.DS2015
Fast Multiple Order-Preserving Matching Algorithms
Myoungji Han, Munseong Kang, Sukhyeun Cho +3
Given a text and a pattern , the order-preserving matching problem is to find all substrings in which have the same relative orders as . Order-preserving matching has…