Approximating Edit Distance within Constant Factor in Truly Sub-Quadratic Time.
Diptarka ChakrabortyDebarati DasElazar GoldenbergMichal KouckýMichael E. SaksPublished in: FOCS (2018)
Keyphrases
- edit distance
- constant factor
- approximation algorithms
- lower bound
- edit operations
- upper bound
- worst case
- graph matching
- similarity measure
- distance measure
- approximate string matching
- levenshtein distance
- string matching
- distance function
- string similarity
- objective function
- computational complexity
- pairwise
- string edit distance
- tree edit distance
- approximate matching
- dynamic programming
- pattern recognition
- graph edit distance
- np hard
- sample complexity
- pattern matching
- data sets
- optimal solution
- learning algorithm