Efficient string matching with k mismatches
Theoretical Computer Science
SIAM Journal on Computing
Introduction to algorithms
Fast algorithms for approximately counting mismatches
Information Processing Letters
Approximate string matching with don't care characters
Information Processing Letters
The AETG System: An Approach to Testing Based on Combinatorial Design
IEEE Transactions on Software Engineering
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
MFCS '94 Proceedings of the 19th International Symposium on Mathematical Foundations of Computer Science 1994
Faster Algorithms for String Matching Problems: Matching the Convolution Bound
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Group Testing Problems with Sequences in Experimental Molecular Biology
SEQUENCES '97 Proceedings of the Compression and Complexity of Sequences 1997
Distributed broadcast in radio networks of unknown topology
Theoretical Computer Science
Faster algorithms for string matching with k mismatches
Journal of Algorithms - Special issue: SODA 2000
Dictionary matching and indexing with errors and don't cares
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
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
Explicit Non-adaptive Combinatorial Group Testing Schemes
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I
A filtering algorithm for k-mismatch with don't cares
SPIRE'07 Proceedings of the 14th international conference on String processing and information retrieval
A linear size index for approximate pattern matching
CPM'06 Proceedings of the 17th Annual conference on Combinatorial Pattern Matching
Almost optimal explicit selectors
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Nonrandom binary superimposed codes
IEEE Transactions on Information Theory
Born again group testing: Multiaccess communications
IEEE Transactions on Information Theory
Noise-resilient group testing: Limitations and constructions
Discrete Applied Mathematics
| Hi-index | 0.00 |
We present solutions 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 a @Q(n(k+logmlogk)logn) time randomised algorithm which finds the correct answer with high probability. We then present a new deterministic @Q(nk^2log^2m) time solution that uses tools originally developed for group testing. Taking our derandomisation approach further we develop an approach based on k-selectors that runs in @Q(nkpolylogm) time. Further, in each case the location of the mismatches at each alignment is also given at no extra cost.