JOURNAL BROWSE
Search
Advanced SearchSearch Tips
A Hashing-Based Algorithm for Order-Preserving Multiple Pattern Matching
facebook(new window)  Pirnt(new window) E-mail(new window) Excel Download
  • Journal title : Journal of KIISE
  • Volume 43, Issue 5,  2016, pp.509-515
  • Publisher : Korean Institute of Information Scientists and Engineers
  • DOI : 10.5626/JOK.2016.43.5.509
 Title & Authors
A Hashing-Based Algorithm for Order-Preserving Multiple Pattern Matching
Kang, Munseong; Cho, Sukhyeun; Sim, Jeong Seop;
 
 Abstract
Given a text T and a pattern P, the order-preserving pattern matching problem is to find all substrings in T which have the same relative orders as P. The order-preserving pattern matching problem has been studied in terms of finding some patterns affected by relative orders, not by their absolute values. Given a text T and a pattern set , the order-preserving multiple pattern matching problem is to find all substrings in T which have the same relative orders as any pattern in . In this paper, we present a hashing-based algorithm for the order-preserving multiple pattern matching problem.
 Keywords
pattern matching;order-preserving pattern matching;order-preserving multiple pattern matching;hashing;
 Language
Korean
 Cited by
 References
1.
D. E. Knuth, J. H. Morris, V. R. Pratt, "Fast pattern matching in strings," SIAM Journal on Computing, Vol. 6, No. 2, pp. 323-350, 1977. crossref(new window)

2.
R. S. Boyer, J. S. Moore, "A fast string searching algorithm," Communications of the ACM, Vol. 20, No. 10, pp. 767-772, 1977.

3.
A. V. Aho, M. J. Corasick, "Efficient string matching: an aid to bibliographic search," Communications of the ACM, Vol. 18, No. 6, pp. 333-340, 1975. crossref(new window)

4.
S. Wu, U. Manber, "A Fast Algorithm For Multi-Pattern Searching," Technical Report TR 94-17, University of Arizona at Tuscon, 1994.

5.
J. Kim, P. Eades, R. Fleischer, S. Hong, C. S. Iliopoulos, K. Park, S. J. Puglisi, T. Tokuyama, "Order Preserving Matching," Theoretical Computer Science, Vol. 525, pp. 68-79, 2014. crossref(new window)

6.
S. Cho, J. C. Na, K. Park, J. S. Sim, "A fast algorithm for order-preserving pattern matching," Information Processing Letters, Vol. 115, No. 2, pp. 397-402, 2015. crossref(new window)

7.
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. crossref(new window)

8.
R. N. Horspool, "Practical fast searching in strings," Software: Practice and Experience, Vol. 10, No. 6, pp. 501-506, 1980. crossref(new window)

9.
S. H. Williamson, Daily Closing Values of the DJA in the United States, 1885 to Present, Measuring Worth, 2015 [Online]. Available: http://www.measuringworth.com/DJA/ (downloaded 2015, Nov. 1)

10.
T. Hirvola, J. Tarhio, "Order-Preserving Matching with Filtration," Experimental Algorithms, pp. 307-314, 2014.

11.
T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, Introduction to Algorithms, 3rd Ed., The MIT Press, 2009.