Lower Bounds for Edit Distance and Product Metrics via Poincaré-Type Inequalities.
Alexandr AndoniT. S. JayramMihai PatrascuPublished in: SODA (2010)
Keyphrases
- edit distance
- lower bound
- lower bounding
- similarity measure
- edit operations
- string similarity
- graph matching
- graph edit distance
- string edit distance
- upper bound
- approximate string matching
- string matching
- objective function
- distance function
- branch and bound algorithm
- distance measure
- dynamic time warping
- distance computation
- tree edit distance
- approximate matching
- levenshtein distance
- np hard
- dynamic programming
- object recognition
- finite alphabet
- pattern recognition
- worst case
- adjacency matrix
- quadratic assignment problem
- multi step