Constant-factor approximation of near-linear edit distance in near-linear time.
Joshua BrakensiekAviad RubinsteinPublished in: CoRR (2019)
Keyphrases
- edit distance
- constant factor approximation
- approximation algorithms
- np hard
- similarity measure
- string matching
- graph edit distance
- edit operations
- graph matching
- worst case
- distance measure
- distance function
- string similarity
- levenshtein distance
- approximate string matching
- tree structured data
- string edit distance
- dynamic programming
- subgraph isomorphism
- distance computation
- approximate matching
- neural network
- closest string
- tree edit distance
- scheduling problem
- mathematical model
- computational complexity
- computer vision