A filtration method for order-preserving matching

Tutkimustuotos: Lehtiartikkelivertaisarvioitu

Tutkijat

Organisaatiot

Kuvaus

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.

Yksityiskohdat

AlkuperäiskieliEnglanti
Sivut71-74
Sivumäärä4
JulkaisuInformation Processing Letters
Vuosikerta116
Numero2
TilaJulkaistu - 1 helmikuuta 2016
OKM-julkaisutyyppiA1 Julkaistu artikkeli, soviteltu

Lataa tilasto

Ei tietoja saatavilla

ID: 1500385