Abstract
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. © 2014 Springer International Publishing Switzerland.
Cite
CITATION STYLE
Kucherov, G., Salikhov, K., & Tsur, D. (2014). Approximate string matching using a bidirectional index. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8486 LNCS, pp. 222–231). Springer Verlag. https://doi.org/10.1007/978-3-319-07566-2_23
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
