Browse > Article
http://dx.doi.org/10.30693/SMJ.2020.9.2.33

Order preserving matching with k mismatches  

Lee, Inbok (한국항공대학교 소프트웨어학과)
Publication Information
Smart Media Journal / v.9, no.2, 2020 , pp. 33-38 More about this Journal
Abstract
Order preserving matching refers to the problem of reporting substrings of a given text where there exists order isomorphism with the pattern. In this paper, we propose a new algorithm based on filtering and evaluation. The proposed algorithm is simple and easy to implement, and runs in linear time on average. Experimental results show that it works efficiently with real world data.
Keywords
string matching; approximate pattern matching; time series data analysis;
Citations & Related Records
Times Cited By KSCI : 6  (Citation Analysis)
연도 인용수 순위
1 Inbok Lee, "Mining Regular Expression Rules based on q-grams," Smart Media Journal, vol. 8, no.3, pp. 17-22, 2019.   DOI
2 허만우, 박기철, 홍지만, "사물인터넷 게이트웨이 보안을 위한 사용자 민감 데이터 분류," 스마트미디어저널, 제8권 제4호, 17-24쪽, 2019년 12월   DOI
3 권혁록, 홍택은, 김판구, "AMI시스템에서 유사도를 활용한 누락데이터 보정 방법," 스마트미디어저널, 제8권, 제4호, 80-84쪽, 2019년 12월   DOI
4 J. Kim, P. Eades, R. Fleischer, S.-H. Hong, C. S. Iliopoulos, K. Park, S. J. Puglisi, T. Tokuyama, "Order-preserving matching," Theoretical Computer Science, vol. 525, pp. 68-79, 2014.   DOI
5 M. Kubica, T. Kulczynski, J. Radoszewski, W. Rytter, T. Walen, "A linear time algorithm for consecutive permutation pattern matching," Information Processing Letters, vol. 113, no. 12, pp. 430-433, 2013.   DOI
6 S. Cho, J. C. Na, K. Park, J. S. Sim, "A fast algorithm for order-preserving pattern matching," Information Processing Letters, vol. 115, pp. 397-402, 2015.   DOI
7 T. Nakamura, S. Inenaga, H. Bannai, M. Takeda, "Order preserving pattern matching on trees and DAGs," Proc of SPIRE, pp. 271-277, 2017.
8 T. Chhabra, Jorma Tarhio, "A filtration method for order-preserving matching," Information Processing Letters, vol. 116, pp. 71-74, 2016.   DOI
9 J. C. Na, I. Lee, "A Simple Heuristic for Order-Preserving Matching," IEICE Transaction on Information and Systems, vol. 102, no. D(3), pp. 502-504, 2019.
10 P. Gawrychowski, P. Uznanski, "Order-preserving pattern matching with k mismatches," Theoretical Computer Science, vol. 638, pp. 136-144, 2016.   DOI
11 T. Chhabra, E. Giaquinta, J. Tarhio, "Filtration Algorithms for Approximate Order-Preserving Matching," Proc of SPIRE, pp. 177-187, 2015.
12 G. Jacobson, K.-P. Vo, "Heaviest increasing/common subsequence problems," Proc of CPM, pp. 52-66, 1992.