Approximating Edit Distance Within Constant Factor in Truly Sub-quadratic Time.
Diptarka ChakrabortyDebarati DasElazar GoldenbergMichal KouckýMichael E. SaksPublished in: J. ACM (2020)
Keyphrases
- edit distance
- constant factor
- approximation algorithms
- lower bound
- graph matching
- string matching
- edit operations
- upper bound
- similarity measure
- worst case
- string edit distance
- distance measure
- approximate string matching
- pairwise
- string similarity
- distance function
- objective function
- levenshtein distance
- tree edit distance
- computational complexity
- sample complexity
- approximate matching
- graph edit distance
- dynamic programming
- np hard
- finite alphabet
- data sets
- special case
- pattern recognition
- feature selection
- computer vision
- machine learning