By Topic

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

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

4 Author(s)
Wang Jun-Bo ; Zhen Zhou Inst. of Inf. Sci. & Technol., Zhen Zhou, China ; Kang Fei ; Xu Xin-lei ; Chen Jing-ning

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.

Published in:

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

Date of Conference:

18-22 Aug. 2010