Abstract
We show that the edit distance between two strings of length n can be computed via a randomized algorithm within a factor of f(") in n1+" time as long as the edit distance is at least n1- for some (") > 0.
Author supplied keywords
Cite
CITATION STYLE
APA
Brakensiek, J., & Rubinstein, A. (2020). Constant-factor approximation of near-linear edit distance in near-linear time. In Proceedings of the Annual ACM Symposium on Theory of Computing (pp. 685–698). Association for Computing Machinery. https://doi.org/10.1145/3357713.3384282
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free