Approximate string-matching with q-grams and maximal matches
Theoretical Computer Science - Selected papers of the Combinatorial Pattern Matching School
A guided tour to approximate string matching
ACM Computing Surveys (CSUR)
Approximate String Matching and Local Similarity
CPM '94 Proceedings of the 5th Annual Symposium on Combinatorial Pattern Matching
Algorithms column: sublinear time algorithms
ACM SIGACT News
Average-optimal single and multiple approximate string matching
Journal of Experimental Algorithmics (JEA)
Large deviations for sums of partly dependent random variables
Random Structures & Algorithms - Isaac Newton Institute Programme “Computation, Combinatorics and Probability”: Part I
On-line approximate string matching with bounded errors
Theoretical Computer Science
| Hi-index | 0.00 |
We introduce a new dimension to the widely studied on-line approximate string matching problem, by introducing an error thresholdparameter 茂戮驴so that the algorithm is allowed to miss occurrences with probability 茂戮驴. This is particularly appropriate for this problem, as approximate searching is used to model many cases where exact answers are not mandatory. We show that the relaxed version of the problem allows us breaking the average-case optimal lower bound of the classical problem, achieving average case O(nlog茂戮驴m/m) time with any $\epsilon = \textrm{poly}(k/m)$, where nis the text size, mthe pattern length, kthe number of errors for edit distance, and 茂戮驴the alphabet size. Our experimental results show the practicality of this novel and promising research direction.