Abstract
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. [13] and Kim et al. [11]. 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.
Cite
CITATION STYLE
Han, M., Kang, M., Cho, S., Gu, G., Sim, J. S., & Park, K. (2016). Fast multiple order-preserving matching algorithms. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9538, pp. 248–259). Springer Verlag. https://doi.org/10.1007/978-3-319-29516-9_21
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
