Approximating Edit Distance Within Constant Factor in Truly Sub-Quadratic Time.
Diptarka ChakrabortyDebarati DasElazar GoldenbergMichal KouckýMichael E. SaksPublished in: CoRR (2018)
Keyphrases
- edit distance
- constant factor
- approximation algorithms
- lower bound
- worst case
- upper bound
- edit operations
- graph matching
- similarity measure
- distance function
- string matching
- distance measure
- approximate string matching
- pairwise
- graph edit distance
- levenshtein distance
- objective function
- string similarity
- approximate matching
- computational complexity
- sample complexity
- dynamic programming
- pattern recognition
- string edit distance
- minimum cost
- data points
- finite alphabet