A filtration method for order-preserving matching
Research output: Contribution to journal › Article
The problem of order-preserving matching has gained attention lately. The text and the pattern consist of numbers. The task is to find all the substrings in the text which have the same length and relative order as the pattern. The problem has applications in analysis of time series. We present a new sublinear solution based on filtration. Any algorithm for exact string matching can be used as a filtering method. If the filtration algorithm is sublinear, the total method is sublinear on average. We show by practical experiments that the new solution is more efficient than earlier algorithms.
|Number of pages||4|
|Journal||Information Processing Letters|
|Publication status||Published - 1 Feb 2016|
|MoE publication type||A1 Journal article-refereed|
- Algorithms, Combinatorial problems, Order-preserving matching, String searching