Upper bounds on the average edit distance between two random strings.
Matthieu RosenfeldPublished in: CoRR (2024)
Keyphrases
- edit distance
- upper bound
- lower bound
- approximate string matching
- string matching
- distance function
- graph matching
- similarity measure
- levenshtein distance
- string similarity
- edit operations
- lower and upper bounds
- string edit distance
- graph edit distance
- distance measure
- dynamic time warping
- tree edit distance
- worst case
- approximate matching
- hamming distance
- tree structured data
- similarity join
- dynamic programming
- triangle inequality
- longest common subsequence
- distance computation
- finite alphabet
- image processing
- pairwise
- image retrieval