SIAM Journal on Computing
Verifying candidate matches in sparse and wildcard matching
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Faster algorithms for string matching with k mismatches
Journal of Algorithms - Special issue: SODA 2000
Pattern matching with address errors: rearrangement distances
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Secure multiparty computation of approximations
ACM Transactions on Algorithms (TALG)
Simple deterministic wildcard matching
Information Processing Letters
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Improved sketching of hamming distance with error correcting
CPM'07 Proceedings of the 18th annual conference on Combinatorial Pattern Matching
A faster algorithm for the computation of string convolutions using LZ78 parsing
Information Processing Letters
| Hi-index | 0.89 |
In matching with don't-cares and k mismatches we are given a pattern of length m and a text of length n, both of which may contain don't-cares (a symbol that matches all symbols), and the goal is to find all locations in the text that match the pattern with at most k mismatches, where k is a parameter. We present new algorithms that solve this problem using a combination of convolutions and a dynamic programming procedure. We give randomized and deterministic solutions that run in time O(nk^2logm) and O(nk^3logm), respectively, and are faster than the most efficient extant methods for small values of k. Our deterministic algorithm is the first to obtain an O(polylog(k)@?nlogm) running time.