Lower bounds for embedding edit distance into normed spaces.
Alexandr AndoniMichel DezaAnupam GuptaPiotr IndykSofya RaskhodnikovaPublished in: SODA (2003)
Keyphrases
- edit distance
- lower bound
- graph matching
- lower bounding
- vector space
- distance measure
- edit operations
- similarity measure
- upper bound
- approximate string matching
- distance computation
- string matching
- levenshtein distance
- dynamic time warping
- branch and bound algorithm
- approximate matching
- string similarity
- string edit distance
- distance function
- objective function
- np hard
- graph edit distance
- tree structured data
- pattern recognition
- subgraph isomorphism
- tree edit distance
- worst case
- pairwise
- image matching
- computer vision
- optimal solution
- similarity join
- dynamic programming
- normalized edit distance
- neural network
- triangle inequality
- quadratic assignment problem
- matching algorithm
- pattern matching
- object recognition
- machine learning