论文信息 - Fast String Searching Mechanism

Fast String Searching Mechanism

The goal of this study is to introduce a novel exact string searching (i.e., matching) method based on the fuzzy transform, or F-transform (FTSS). The theoretical background of the F-transform, specifically the F s -transform, s 0, for functions of one variable is reviewed, and a string searching algorithm based on this theory is presented. The algorithm is demonstrated with several examples. The results are compared with those of three existing string searching algorithms: Knuth-MorrisPratt (KMP), Boyer-Moore (BM) and Rabin-Karp (RK).

[1] R. Kurzweil,et al. The Singularity Is Near: When Humans Transcend Biology , 2006 .

[2] Robert S. Boyer,et al. A fast string searching algorithm , 1977, CACM.

[3] Raymond C. Kurzweil,et al. The Singularity Is Near , 2018, The Infinite Desire for Growth.

[4] Irina Perfilieva,et al. Fuzzy transforms: Theory and applications , 2006, Fuzzy Sets Syst..

[5] Donald E. Knuth,et al. Fast Pattern Matching in Strings , 1977, SIAM J. Comput..

[6] Martina Danková,et al. Towards a higher degree F-transform , 2011, Fuzzy Sets Syst..

[7] 英哉岩崎. 20世紀の名著名論：D. E. Knuth J. H. Morris V. R. Pratt : Fast pattern matching in Strings , 2004 .

[8] Adam Jacobs,et al. The pathologies of big data , 2009, Commun. ACM.

[9] Petr Hurtík,et al. F-transform and Its Extension as Tool for Big Data Processing , 2014, IPMU.

[10] Richard M. Karp,et al. Efficient Randomized Pattern-Matching Algorithms , 1987, IBM J. Res. Dev..