By Topic

A Practical and Average Optimal String Matching Algorithm Based on Lecroq

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)
Fan Hongbo ; Coll. of Comput. Sci. & Technol., Harbin Eng. Univ., Harbin, China ; Yao Nianmin ; Ma Haifeng

The Lecroq algorithm is the best current solutions of single pattern string matching for binary text. In this paper, we simplify Lecroq and propose a more practical variant which is named S-Lecroq. We analysis the complexity of S-Lecroq and proof that S-Lecroq is optimal in average.

Published in:

Internet Computing for Science and Engineering (ICICSE), 2010 Fifth International Conference on

Date of Conference:

1-2 Nov. 2010