Fast String Searching Mechanism
Petr Hurtik, Petra Hodakova, Irina Perfilieva
Available Online June 2015.
- https://doi.org/10.2991/ifsa-eusflat-15.2015.60How to use a DOI?
- Big data, Pattern searching, String searching, F-transform, Fs-transform, Generalized fuzzy partition
- 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 Fs-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-Morris- Pratt (KMP), Boyer-Moore (BM) and Rabin-Karp (RK).
- Open Access
- This is an open access article distributed under the CC BY-NC license.
Cite this article
TY - CONF AU - Petr Hurtik AU - Petra Hodakova AU - Irina Perfilieva PY - 2015/06 DA - 2015/06 TI - Fast String Searching Mechanism BT - Proceedings of the 2015 Conference of the International Fuzzy Systems Association and the European Society for Fuzzy Logic and Technology PB - Atlantis Press SP - 412 EP - 418 SN - 1951-6851 UR - https://doi.org/10.2991/ifsa-eusflat-15.2015.60 DO - https://doi.org/10.2991/ifsa-eusflat-15.2015.60 ID - Hurtik2015/06 ER -