Approximate string matching using a bidirectional index

Gregory Kucherov, Kamil Salikhov, Dekel Tsur

Research output: Contribution to journalArticlepeer-review

9 Citations (Scopus)


We study strategies of approximate pattern matching that exploit bidirectional text indexes, extending and generalizing ideas of [9]. 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 efficient search schemes, and finally, provide experimental computations supporting the superiority of our strategies.

Original languageEnglish
Pages (from-to)145-158
Number of pages14
JournalTheoretical Computer Science
Publication statusPublished - 25 Jul 2016
Externally publishedYes


  • Approximate pattern matching


Dive into the research topics of 'Approximate string matching using a bidirectional index'. Together they form a unique fingerprint.

Cite this