Paper Info
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.
Year
DOI
Venue
2013
10.1016/j.tcs.2015.10.043
Theoretical Computer Science
Keywords
DocType
Volume
Approximate pattern matching
Journal
638
Issue
ISSN
Citations 
C
0304-3975
5
PageRank 
References 
Authors
0.43
14
3
Name
Order
Citations
PageRank
Gregory Kucherov1100374.54
Kamil Salikhov2332.69
Dekel Tsur345041.90