Constant-factor approximation of near-linear edit distance in near-linear time.
Joshua BrakensiekAviad RubinsteinPublished in: STOC (2020)
Keyphrases
- edit distance
- constant factor approximation
- approximation algorithms
- edit operations
- np hard
- string matching
- graph matching
- similarity measure
- levenshtein distance
- worst case
- minimum cost
- distance measure
- string edit distance
- graph edit distance
- dynamic programming
- distance computation
- distance function
- approximate string matching
- string similarity
- tree edit distance
- computer vision
- tree structured data
- approximate matching
- query processing
- special case
- subgraph isomorphism
- matching algorithm
- closest string