A Lower Bound for the Edit-Distance Problem Under an Arbitrary Cost Function.
Xiaoqiu HuangPublished in: Inf. Process. Lett. (1988)
Keyphrases
- edit distance
- cost function
- lower bound
- lower bounding
- upper bound
- objective function
- graph matching
- edit operations
- string matching
- similarity measure
- distance function
- string similarity
- levenshtein distance
- approximate string matching
- graph edit distance
- distance measure
- optimal solution
- string edit distance
- lower and upper bounds
- tree edit distance
- tree structured data
- dynamic programming
- approximate matching
- branch and bound algorithm
- worst case
- distance computation
- dissimilarity measure
- dynamic time warping
- np hard
- subgraph isomorphism
- relaxation labeling
- object recognition
- data structure