Show simple item record

dc.contributor.authorKim, J.
dc.contributor.authorEades, P.
dc.contributor.authorFleischer, R.
dc.contributor.authorHong, S.
dc.contributor.authorIliopoulos, Costas
dc.contributor.authorPark, K.
dc.contributor.authorPuglisi, Simon
dc.contributor.authorTokuyama, T.
dc.identifier.citationKim, J. and Eades, P. and Fleischer, R. and Hong, S. and Iliopoulos, C. and Park, K. and Puglisi, S. et al. 2014. Order-preserving matching. Theoretical Computer Science. 525: pp. 68-79.

We introduce a new string matching problem called order-preserving matching on numeric strings, where a pattern matches a text if the text contains a substring of values whose relative orders coincide with those of the pattern. Order-preserving matching is applicable to many scenarios such as stock price analysis and musical melody matching in which the order relations should be matched instead of the strings themselves. Solving order-preserving matching is closely related to the representation of order relations of a numeric string. We define the prefix representation and the nearest neighbor representation of the pattern, both of which lead to efficient algorithms for order-preserving matching. We present efficient algorithms for single and multiple pattern cases. For the single pattern case, we give an O(nlogm) time algorithm and optimize it further to obtain O(n+mlogm) time. For the multiple pattern case, we give an O(nlogm) time algorithm.

dc.titleOrder-preserving matching
dc.typeJournal Article
dcterms.source.titleTheoretical Computer Science
curtin.departmentDepartment of Mathematics and Statistics
curtin.accessStatusFulltext not available

Files in this item


This item appears in the following Collection(s)

Show simple item record