Speeding up the cyclic edit distance using LAESA with early abandon.
Vicente Palazón-GonzálezAndrés MarzalPublished in: Pattern Recognit. Lett. (2015)
Keyphrases
- edit distance
- edit operations
- graph matching
- similarity measure
- string matching
- distance measure
- string similarity
- distance function
- levenshtein distance
- approximate string matching
- string edit distance
- dynamic programming
- dynamic time warping
- tree structured data
- tree edit distance
- distance computation
- graph edit distance
- subgraph isomorphism
- approximate matching
- dissimilarity measure
- computer vision
- pattern recognition
- object recognition
- finite alphabet
- pairwise