Close category search window
 

A fast single pattern matching algorithm for the longer pattern

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
$31 $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

3 Author(s)
Wang Jun-bo ; Zhengzhou Inst. of Inf. Sci. & Technol., Zhengzhou, China ; Kang Fei ; Li Yang

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-QLP 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 long, the performance of QLP algorithm is more excellent than other similar algorithms.

Published in:
Future Computer and Communication (ICFCC), 2010 2nd International Conference on  (Volume:2 )

Date of Conference: 21-24 May 2010

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.