Fast Multiple Order-Preserving Matching Algorithms

Myoungji Han, Munseong Kang, Sukhyeun Cho +3

Given a text $T$ and a pattern $P$, the order-preserving matching problem is to find all substrings in $T$ which have the same relative orders as $P$. Order-preserving matching has…