Approximate String Matching using a Bidirectional Index - CNRS - Centre national de la recherche scientifique Accéder directement au contenu
Rapport Année : 2013

Approximate String Matching using a Bidirectional Index

Résumé

We study strategies of approximate pattern matching that exploit bidirectional text indexes, extending and generalizing ideas of [6]. We introduce a formalism, called search schemes, to specify search strategies of this type, then develop a probabilistic measure for the efficiency of a search scheme, prove several combinatorial results on e cient search schemes, and nally, provide experimental computations supporting the superiority of our strategies.
Fichier non déposé

Dates et versions

hal-00824706 , version 1 (22-05-2013)

Identifiants

  • HAL Id : hal-00824706 , version 1

Citer

Gregory Kucherov, Dekel Tsur. Approximate String Matching using a Bidirectional Index. 2013. ⟨hal-00824706⟩
174 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More