Skip to Main content Skip to Navigation
Reports

Saving comparisons in the Crochemore-Perrin string matching algorithm

Abstract : Crochemore and Perrin discovered an elegant linear-time constant-space string matching algorithm that makes at most 2n - m symbol comparison. This paper shows how to modify their algorithm to use fewer comparisons. Given any fixed [??] the new algorithm takes linear time, uses constant space and makes at most [??] symbol comparisons. If O(log m) space is available, then the algorithm makes at most [??] symbol comparisons. The pattern preprocessing step also takes linear time and uses constant space. These are the first string matching algorithms that make fewer then 2n - m symbol comparisons and use sub-linear space.
Document type :
Reports
Complete list of metadata

https://hal.inria.fr/inria-00074535
Contributor : Rapport de Recherche Inria <>
Submitted on : Wednesday, May 24, 2006 - 3:42:10 PM
Last modification on : Thursday, February 11, 2021 - 2:50:06 PM
Long-term archiving on: : Tuesday, April 12, 2011 - 3:50:52 PM

Identifiers

  • HAL Id : inria-00074535, version 1

Collections

Citation

Dany Breslauer. Saving comparisons in the Crochemore-Perrin string matching algorithm. [Research Report] RR-2137, INRIA. 1993. ⟨inria-00074535⟩

Share

Metrics

Record views

183

Files downloads

212