Referenced Items are not available for this document.
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
- Page(s):
- 57 - 63
- Print ISBN:
- 978-1-4244-9954-0
- INSPEC Accession Number:
- 12360776
- Conference Location :
- Heilongjiang
- Digital Object Identifier :
- 10.1109/ICICSE.2010.41
- 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.
