Acknowledgement
Supported by : 한국연구재단
References
- 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. https://doi.org/10.1137/0206024
- R. S. Boyer, J. S. Moore, "A fast string searching algorithm," Communications of the ACM, Vol. 20, No. 10, pp. 767-772, 1977.
- 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. https://doi.org/10.1145/360825.360855
- S. Wu, U. Manber, "A Fast Algorithm For Multi-Pattern Searching," Technical Report TR 94-17, University of Arizona at Tuscon, 1994.
- 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. https://doi.org/10.1016/j.tcs.2013.10.006
- 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. https://doi.org/10.1016/j.ipl.2014.10.018
- 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. https://doi.org/10.1016/j.ipl.2013.03.015
- R. N. Horspool, "Practical fast searching in strings," Software: Practice and Experience, Vol. 10, No. 6, pp. 501-506, 1980. https://doi.org/10.1002/spe.4380100608
- 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)
- T. Hirvola, J. Tarhio, "Order-Preserving Matching with Filtration," Experimental Algorithms, pp. 307-314, 2014.
- T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, Introduction to Algorithms, 3rd Ed., The MIT Press, 2009.