A Fast Single Pattern Matching Algorithm Based on the Bit-Parallel

Author

Wang Jun-Bo ; Kang Fei ; Xu Xin-lei ; Chen Jing-ning

Author_Institution

Zhen Zhou Inst. of Inf. Sci. & Technol., Zhen Zhou, China

fYear

2010

fDate

18-22 Aug. 2010

Firstpage

17

Lastpage

21

Abstract

The string matching algorithm is an important one of the key techniques. On the basis of the research on some kind of algorithms and the test to these algorithms, a faster single-mode matching algorithm-QBP algorithm is proposed in this paper. By adding the seat shifted table and using the fixed window in this algorithm, higher efficiency is achieved. It is illustrated by an experiment that when the character string is within a machine word-length, the performance of QBP algorithm is more excellent than other similar algorithms.

Keywords

pattern matching; QBP algorithm; bit-parallel; character string; fixed window; machine word-length; pattern matching algorithm; seat shifted table; single-mode matching algorithm; string matching algorithm; Algorithm design and analysis; Biology; Complexity theory; Computers; Intrusion detection; Partitioning algorithms; Pattern matching; BM; BNDM; KMP; Sunday; bit parallel element; bit-parallel table; pattern matching;

fLanguage

English

Publisher

ieee

Conference_Titel

Frontier of Computer Science and Technology (FCST), 2010 Fifth International Conference on

Conference_Location

Changchun, Jilin Province

Print_ISBN

978-1-4244-7779-1

Type

conf

DOI

10.1109/FCST.2010.12

Filename

5576123