Efficient string matching with k mismatches
Theoretical Computer Science
SIAM Journal on Computing
Introduction to algorithms
Approximate string matching with don't care characters
Information Processing Letters
A fast string searching algorithm
Communications of the ACM
Selective families, superimposed codes, and broadcasting on unknown radio networks
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Verifying candidate matches in sparse and wildcard matching
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Efficient pattern-matching with don't cares
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Faster Algorithms for String Matching Problems: Matching the Convolution Bound
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Faster algorithms for string matching with k mismatches
Journal of Algorithms - Special issue: SODA 2000
Simple deterministic wildcard matching
Information Processing Letters
Efficient string matching in the presence of errors
SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science
Almost optimal explicit selectors
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Approximating general metric distances between a pattern and a text
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
A Black Box for Online Approximate Pattern Matching
CPM '08 Proceedings of the 19th annual symposium on Combinatorial Pattern Matching
SPIRE '08 Proceedings of the 15th International Symposium on String Processing and Information Retrieval
Matching with don't-cares and a small number of mismatches
Information Processing Letters
From coding theory to efficient pattern matching
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Compressed sensing with probabilistic measurements: a group testing solution
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Approximate sparse recovery: optimizing time and measurements
Proceedings of the forty-second ACM symposium on Theory of computing
A faster algorithm for the computation of string convolutions using LZ78 parsing
Information Processing Letters
Superselectors: efficient constructions and applications
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Fingerprinting ratings for collaborative filtering: theoretical and empirical analysis
SPIRE'10 Proceedings of the 17th international conference on String processing and information retrieval
A black box for online approximate pattern matching
Information and Computation
Information and Computation
Approximate Sparse Recovery: Optimizing Time and Measurements
SIAM Journal on Computing
Homomorphic fingerprints under misalignments: sketching edit and shift distances
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
| Hi-index | 0.00 |
We give the first non-trivial algorithms for the k-mismatch pattern matching problem with don't cares. Given a text t of length n and a pattern p of length m with don't care symbols and a bound k, our algorithms find all the places that the pattern matches the text with at most k mismatches. We first give an O(n(k + log n log log n) logm) time randomised solution which finds the correct answer with high probability. We then present a new deterministic O(nk2 log3 m) time solution that uses tools developed for group testing and finally an approach based on k-selectors that runs in O(nk polylog m) time but requires O(poly m) time preprocessing. In each case, the location of the mismatches at each alignment is also given at no extra cost.