Referenced Items are not available for this document.
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
- Page(s):
- 17 - 21
- Print ISBN:
- 978-1-4244-7779-1
- INSPEC Accession Number:
- 11534686
- Conference Location :
- Changchun, Jilin Province
- Digital Object Identifier :
- 10.1109/FCST.2010.12
- Product Type:
- Conference Publications
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.
