Computer Theory and Application Laboratory

Fast Multiple Order-Preserving Matching Algorithms


Fast Multiple Order-Preserving Matching Algorithms

Myoungji Han, Munseong kang, Sukhyeun Cho, Geonmo Gu, Jeong Seop Sim, and Kunsoo Park


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 been an active research area since it was introduced by Kubica et al. [1] and Kim et al. [2]. In this paper we present two algorithms for the multiple order-preserving matching problem, one of which runs in sublinear time on average and the other in linear time on average. Both algorithms run much faster than the previous algorithms.



The code for this work can be downloaded here.



1. Kubica, M., Kulczy´nski, T., Radoszewski, J., Rytter, W., Wale´n, T.: A linear time
algorithm for consecutive permutation pattern matching. Information Processing
Letters 113(12), 430-433 (2013)

2. Kim, J., Eades, P., Fleischer, R., Hong, S., Iliopoulos, C.S., Park, K., Puglisi, S.J.,
Tokuyama, T.: Order-preserving matching. Theoretical Computer Science 525, 68–
79 (2014)


Contact us at: