Order preserving pattern matching revisited

• We study the order preserving pattern matching problem.
• We focus on string regularities from an order preserving point of view.
• We also present yet another efficient order preserving pattern matching algorithm.
• We modify the Z-algorithm to make it useful in the order preserving framework.

In this paper, we study the order preserving pattern matching (OPPM) problem, which is a very recent variant of the classic pattern matching problem. We revisit this variant, present a new interesting pattern matching algorithm and for the first time consider string regularities from this new perspective.