Name
Abstract | ||
|---|---|---|
Edit distance is a measure of similarity of two strings based on the minimum number of character insertions, deletions, and substitutions required to transform one string into the other. The edit distance can be computed exactly using a dynamic programming algorithm that runs in quadratic time. Andoni, Krauthgamer and Onak (2010) gave a nearly linear time algorithm that approximates edit distance within approximation factor poly(log n). In this paper, we provide an algorithm with running time Õ(n^2-2/7) that approximates the edit distance within a constant factor. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1109/FOCS.2018.00096 | 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS) |
Keywords | DocType | Volume |
Edit distance,Approximation algorithm,Sub quadratic time algorithm,Randomized algorithm | Conference | abs/1810.03664 |
ISSN | ISBN | Citations |
1523-8288 | 978-1-5386-4231-3 | 1 |
PageRank | References | Authors |
0.35 | 12 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Diptarka Chakraborty | 1 | 4 | 1.06 |
| Debarati Das | 2 | 2 | 6.49 |
| Elazar Goldenberg | 3 | 4 | 3.85 |
| Michal Koucky | 4 | 77 | 6.06 |
| Michael Saks | 5 | 2595 | 302.11 |