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.
Type de document :
Rapport
[Research Report] RR-2137, INRIA. 1993
Liste complète des métadonnées

https://hal.inria.fr/inria-00074535
Contributeur : Rapport de Recherche Inria <>
Soumis le : mercredi 24 mai 2006 - 15:42:10
Dernière modification le : vendredi 16 septembre 2016 - 15:13:17
Document(s) archivé(s) le : mardi 12 avril 2011 - 15:50:52

Fichiers

Identifiants

  • 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〉

Partager

Métriques

Consultations de la notice

134

Téléchargements de fichiers

68