Open AccessJournal Article
Improved multiple patterns string matching algorithm
1
TL;DR: A faster algorithm for performing multiple patterns matching in a string was proposed on the basis of Aho-Corasick (AC) algorithm, which achieves excellent performance in the cases of both short patterns and long patterns.
read more
Abstract: Combined with the advantage of the Boyer-Moore-Hoospool (BMH) algorithm, a faster algorithm for performing multiple patterns matching in a string was proposed on the basis of Aho-Corasick (AC) algorithm In general, it does not need to inspect every character of the string It skips as many characters as possible to decrease pattern match operations before matching patterns The proposed algorithm achieves excellent performance in the cases of both short patterns and long patterns Experimental results show that in case of short patterns the time it takes for the proposed algorithm to search a string is only 50%～30% that of the AC algorithm, while in case of long patterns the ratio is 267%～152%
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
An improved multiple patterns matching algorithm for intrusion detection
Zhengqiang
- 06 Dec 2010
TL;DR: Experimental results show that when pattern group contains a pattern that is less than three bytes, the performance of the improved Wu- manber algorithm is much better than the traditional Wu-Manber algorithm.
13