This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2010 Fifth International Conference on Internet Computing for Science and Engineering
A Practical and Average Optimal String Matching Algorithm Based on Lecroq
Harbin, Hei Long Jiang China
November 01-November 02
ISBN: 978-0-7695-4339-0
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.
Index Terms:
sting matching; complexity; q-grams hash; Lecroq; design of algorithm
Citation:
Hongbo Fan, Nianmin Yao, Haifeng Ma, "A Practical and Average Optimal String Matching Algorithm Based on Lecroq," icicse, pp.57-63, 2010 Fifth International Conference on Internet Computing for Science and Engineering, 2010
Usage of this product signifies your acceptance of the Terms of Use.