Dynamic multiple pattern detection algorithm

Simple item page
dc.contributor.authorKhancome, Chouvalit
dc.contributor.authorBoonjing, Veera
dc.date.accessioned2026-08-06T10:00:25Z
dc.date.available2026-08-06T10:00:25Z
dc.date.issued2010-07-12
dc.description.abstractThe 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. © 2010 IEEE.
dc.identifier.citation2nd International Conference on Computer and Network Technology Iccnt 2010, 48-52, 2010
dc.identifier.doi10.1109/ICCNT.2010.90
dc.identifier.other2-s2.0-77954323848
dc.identifier.urihttps://dspace.kmitl.ac.th/handle/123456789/3094
dc.source2nd International Conference on Computer and Network Technology Iccnt 2010
dc.subjectInverted index
dc.subjectInverted lists
dc.subjectMultiple pattern
dc.subjectStatic dictionary matching
dc.subjectString matching
dc.titleDynamic multiple pattern detection algorithm
dc.typeConference Paper

Files

Collections

Research