By Topic

Dynamic Multiple Pattern Detection Algorithm

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
$33 $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

2 Author(s)
Chouvalit Khancome ; Dept. of Math. & Comput. Sci., King Monkut's Inst. of Technol. at Ladkrabang(KMITL), Bangkok, Thailand ; Veera Boonjing

The multiple pattern matching has always been a significant principle for applying to a network security system. This principle is adapted to accommodate the target patterns to be detected in a pre-processing phase, and the objective text and the suspect patterns are simultaneously detected by comparing with the existing structure. This research article introduces a new algorithm of multi-string pattern matching by means of a new data structure called inverted lists. The inverted lists structure, inherited from the inverted index, is represented by the positions of characters which appear in the patterns. The new algorithm, which is more efficient time than the traditional algorithms, scans the given text in a single pass. More importantly, the structure of patterns is able to update the patterns over time.

Published in:

Computer and Network Technology (ICCNT), 2010 Second International Conference on

Date of Conference:

23-25 April 2010