Order preserving pattern matching on trees and DAGs

Temma Nakamura, Shunsuke Inenaga, Hideo Bannai +1

The order preserving pattern matching (OPPM) problem is, given a pattern string $p$ and a text string $t$, find all substrings of $t$ which have the same relative orders as $p$. In…