# Order-preserving pattern matching with k mismatches

arXiv: https://arxiv.org/abs/1309.6453 · HTML: https://mlsanity.com/paper/1309.6453/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 25 Sep 2013.

## Built on by (most cited first, 1 of 1)

- [OPP-Miner: Order-preserving sequential pattern mining](https://mlsanity.com/paper/2202.03140/) (2022)

## Abstract (arXiv)

We study a generalization of the recently introduced order-preserving pattern matching, where instead of looking for an exact copy of the pattern, we only require that the relative order between the elements is the same. In our variant, we additionally allow up to k mismatches between the pattern and the text, and the goal is to construct an efficient algorithm for small values of k. For a pattern of length m and a text of length n, our algorithm detects an order-preserving occurrence with up to k mismatches in O(n(loglogm + kloglogk)) time.