Saving comparisons in the Crochemore-Perrin string matching algorithm - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 1993

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.

Domains

Other [cs.OH]
Fichier principal
Vignette du fichier
RR-2137.pdf (837.18 Ko) Télécharger le fichier

Dates and versions

inria-00074535 , version 1 (24-05-2006)

Identifiers

  • HAL Id : inria-00074535 , version 1

Cite

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

Share

Gmail Facebook X LinkedIn More