Edit Distance in Near-Linear Time: it's a Constant Factor.
Alexandr AndoniNegev Shekel NosatzkiPublished in: CoRR (2020)
Keyphrases
- edit distance
- constant factor
- worst case
- approximation algorithms
- lower bound
- graph matching
- upper bound
- edit operations
- string matching
- similarity measure
- levenshtein distance
- np hard
- distance measure
- dynamic programming
- string similarity
- approximate matching
- distance function
- string edit distance
- data sets
- sample size
- sample complexity
- special case
- tree edit distance
- graph edit distance
- branch and bound
- finite alphabet
- normalized edit distance
- object recognition
- computational complexity
- pattern recognition
- decision trees