论文信息 - Fuzzified Aho-Corasick search automata

Fuzzified Aho-Corasick search automata

In this paper, we discuss the need for efficient approximate string matching. We present the well-known Aho-Corasick automaton for locating multiple patterns and discuss an approach for fuzzification of this automaton. Along with some motivational examples, we propose and illustrate a novel algorithm for automaton construction.

[1] Hung T. Nguyen,et al. A First Course in Fuzzy Logic , 1996 .

[2] Peter R. J. Asveld,et al. A Bibliography on Fuzzy Automata, Grammars and Lanuages , 1995 .

[3] Stefan Kurtz,et al. Approximate String Searching under Weighted Edit Distance , 1996 .

[4] Davender Malik,et al. Minimization of Fuzzy Automata , 2002 .

[5] C.J.H. Mann,et al. Fuzzy Relational Systems: Foundations and Principles , 2003 .

[6] Radim Bělohlávek,et al. Fuzzy Relational Systems: Foundations and Principles , 2002 .

[7] Brian Cantwell Smith,et al. The Foundations of Computing , 1996 .

[8] S. Muthukrishnan,et al. New Results and Open Problems Related to Non-Standard Stringology , 1995, CPM.

[9] Alfred V. Aho,et al. Efficient string matching , 1975, Commun. ACM.

[10] Václav Snásel,et al. YAPS: Yet Another Protein Similarity , 2009, 2009 International Conference of Soft Computing and Pattern Recognition.

[11] Václav Snásel,et al. Prosima: Protein similarity algorithm , 2009, 2009 World Congress on Nature & Biologically Inspired Computing (NaBIC).