By Topic

Fuzzified Aho-Corasick search automata

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Horak, Z. ; Dept. of Comput. Sci., VSB - Tech. Univ. of Ostrava, Ostrava, Czech Republic ; Snasel, V. ; Abraham, A. ; ella Hassanien, A.

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.

Published in:

Information Assurance and Security (IAS), 2010 Sixth International Conference on

Date of Conference:

23-25 Aug. 2010