A theory of parameterized pattern matching: algorithms and applications
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Efficient 2-dimensional approximate matching of half-rectangular figures
Information and Computation
An Extension of the String-to-String Correction Problem
Journal of the ACM (JACM)
Introduction to Algorithms
On the complexity of the Extended String-to-String Correction Problem
STOC '75 Proceedings of seventh annual ACM symposium on Theory of computing
Algorithmic Applications of Low-Distortion Geometric Embeddings
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
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
SPIRE '08 Proceedings of the 15th International Symposium on String Processing and Information Retrieval
δ γ --- Parameterized Matching
SPIRE '08 Proceedings of the 15th International Symposium on String Processing and Information Retrieval
Information and Computation
| Hi-index | 0.00 |
Let T = t0 … tn-1 be a text and P = p0 … pm-1 a pattern taken from some finite alphabet set Σ, and let d be a metric on Σ. We consider the problem of calculating the sum of distances between the symbols of P and the symbols of substrings of T of length m for all possible offsets. We present an ε-approximation algorithm for this problem which runs in time O(1/ε2n · polylog(n, |Σ|)). This algorithm is based on a low distortion embedding of metric spaces into normed spaces (especially, into ℓ∞), which is done as a preprocessing stage. The algorithm is also based on a technique of sampling.