Edit Distance Cannot Be Computed in Strongly Subquadratic Time (Unless SETH is False)
© 2018 Society for Industrial and Applied Mathematics. The edit distance (a.k.a. the Levenshtein distance) between two strings is defined as the minimum number of insertions, deletions, or substitutions of symbols needed to transform one string into another. The problem of computing the edit distanc...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Society for Industrial & Applied Mathematics (SIAM),
2021-11-05T19:09:50Z.
|
| Subjects: | |
| Online Access: | Get fulltext |