ScholarLens Back to search
2006•Jisuanji gongchengRequires access

An Improved String Matching Algorithm

Jingang Liu

Open publisher page 6 citations

Abstract

String matching algorithm is an important method in intrusion detection. An improved algorithm is proposed for string matching based on the discussions of several common string matching algorithms, for example, BF, KMP, BM, Sunday, etc. This algorithm can jump over more characters to do next matching when this matching is lost. At the same time, the matching times decreases sharply. In this case, it improves the matching efficiency. In the end, the analysis of this algorithm’s performance and the comparisons of the testing results of several matching algorithms are given.

About this research paper

What this paper is about

String matching algorithm is an important method in intrusion detection. An improved algorithm is proposed for string matching based on the discussions of several common string matching algorithms, for example, BF, KMP, BM, Sunday, etc. This algorithm can jump over more characters to do next matching when this matching is lost. At the same time, the matching times decreases sharply. In this case, it improves the matching efficiency. In the end, the analysis of this algorithm’s performance and the comparisons of the testing results of several matching algorithms are given.

Why it matters

OpenAlex reports 6 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

String matching algorithm is an important method in intrusion detection. An improved algorithm is proposed for string matching based on the discussions of several common string matching algorithms, for example, BF, KMP, BM, Sunday, etc. This algorithm can jump over more characters to do next matching when this matching is lost. At the same time, the matching times decreases sharply. In this case, it improves the matching efficiency. In the end, the analysis of this algorithm’s performance and the comparisons of the testing results of several matching algorithms are given.

Key concepts: String searching algorithm, Commentz-Walter algorithm, Computer science, Matching (statistics), Approximate string matching, String metric, Boyer–Moore string search algorithm, Jump

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
An Improved String Matching Algorithm — Research Paper | ScholarLens