A fast implementation of the Boyer-Moore string matching algorithm

Maxime Crochemore 1, 2 Thierry Lecroq 3
1 DCS - Department of Computer Science
2 LIGM - Laboratoire d'Informatique Gaspard-Monge
3 LITIS - Laboratoire d'Informatique, de Traitement de l'Information et des Systèmes
Document type :
Other publications
Complete list of metadatas
https://hal.archives-ouvertes.fr/hal-00470115
Contributor : Thierry Lecroq <>
Submitted on : Saturday, April 3, 2010 - 4:56:17 PM
Last modification on : Thursday, May 9, 2019 - 8:02:02 PM

Identifiers

  • HAL Id : hal-00470115, version 1

Collections

CNRS | LITIS | PARISTECH | ENPC | LIGM | LIGM_ALGO | UNIV-MLV | UPEC-UPEM | COMUE-NORMANDIE | INSA-ROUEN | UNIROUEN | UNILEHAVRE | INSA-GROUPE

Citation

Maxime Crochemore, Thierry Lecroq. A fast implementation of the Boyer-Moore string matching algorithm. 2007. ⟨hal-00470115⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

257

Contact

Informations

CCSD