Randomized Swap Matching in $O(m \log m \log |\Sigma| )$ time

Authors:
R. Cole;R. Hariharan
Affiliations:
-;-
Venue:
Randomized Swap Matching in $O(m \'log m \'log |\'Sigma| )$ time
Year:
1999

Citing 0
Cited 5

Overlap matching

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Approximate swapped matching

Information Processing Letters
Approximate Swapped Matching

FST TCS 2000 Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science
Overlap matching

Information and Computation
Property matching and weighted matching

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We give a randomized algorithm for the {\em Pattern Matching with Swaps} problem which runs in $O(m \log m \log |\Sigma| )$ time on a text of length $2m-1$ and a pattern of length $m$ drawn from an alphabet set of size $|\Sigma|$. This algorithm gives the correct answer with probability at least $1-\frac{1}{m}$ and does not miss a match. The best deterministic algorithm known for this problem takes $O(m^{4/3} \mbox{polylog}(m))$ time.