TY - GEN
T1 - Approximate string matching using a bidirectional index
AU - Kucherov, Gregory
AU - Salikhov, Kamil
AU - Tsur, Dekel
PY - 2014/1/1
Y1 - 2014/1/1
N2 - We study strategies of approximate pattern matching that exploit bidirectional text indexes, extending and generalizing ideas of [5]. 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 [5]. 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.
UR - https://www.scopus.com/pages/publications/84958522602
U2 - 10.1007/978-3-319-07566-2_23
DO - 10.1007/978-3-319-07566-2_23
M3 - Conference contribution
AN - SCOPUS:84958522602
SN - 9783319075655
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 222
EP - 231
BT - Combinatorial Pattern Matching - 25th Annual Symposium, CPM 2014, Proceedings
PB - Springer Verlag
T2 - 25th Annual Symposium on Combinatorial Pattern Matching, CPM 2014
Y2 - 16 June 2014 through 18 June 2014
ER -