Approximate string matching using a bidirectional index

Gregory Kucherov; Kamil Salikhov; Dekel Tsur

doi:https://doi.org/10.1016/j.tcs.2015.10.043

Approximate string matching using a bidirectional index

Gregory Kucherov, Kamil Salikhov, Dekel Tsur

Department of Computer Science

Ben-Gurion University of the Negev

Research output: Contribution to journal › Article › peer-review

Abstract

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 language	American English
Pages (from-to)	145-158
Number of pages	14
Journal	Theoretical Computer Science
Volume	638
DOIs	https://doi.org/10.1016/j.tcs.2015.10.043
State	Published - 25 Jul 2016

Keywords

Approximate pattern matching

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
General Computer Science

Access to Document

https://doi.org/10.1016/j.tcs.2015.10.043

Cite this

@article{3d45a2fc03954286b60e7501ff89aae3,

title = "Approximate string matching using a bidirectional index",

abstract = "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.",

keywords = "Approximate pattern matching",

author = "Gregory Kucherov and Kamil Salikhov and Dekel Tsur",

note = "Publisher Copyright: {\textcopyright} 2015 Elsevier B.V.",

year = "2016",

month = jul,

day = "25",

doi = "https://doi.org/10.1016/j.tcs.2015.10.043",

language = "American English",

volume = "638",

pages = "145--158",

journal = "Theoretical Computer Science",

issn = "0304-3975",

publisher = "Elsevier",

}

TY - JOUR

T1 - Approximate string matching using a bidirectional index

AU - Kucherov, Gregory

AU - Salikhov, Kamil

AU - Tsur, Dekel

PY - 2016/7/25

Y1 - 2016/7/25

N2 - 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.

AB - 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.

KW - Approximate pattern matching

UR - http://www.scopus.com/inward/record.url?scp=84973171222&partnerID=8YFLogxK

U2 - https://doi.org/10.1016/j.tcs.2015.10.043

DO - https://doi.org/10.1016/j.tcs.2015.10.043

M3 - Article

SN - 0304-3975

VL - 638

SP - 145

EP - 158

JO - Theoretical Computer Science

JF - Theoretical Computer Science

ER -

Approximate string matching using a bidirectional index

Abstract

Keywords

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this