Almost-optimal sublinear-time edit distance in the low distance regime.
Karl BringmannAlejandro CassisNick FischerVasileios NakosPublished in: STOC (2022)
Keyphrases
- edit distance
- string edit distance
- distance measure
- tree edit distance
- distance function
- dynamic programming
- distance computation
- levenshtein distance
- triangular inequality
- hamming distance
- triangle inequality
- graph matching
- edit operations
- similarity measure
- string matching
- dissimilarity measure
- approximate matching
- string similarity
- longest common subsequence
- approximate string matching
- cosine distance
- binary search trees
- euclidean distance
- graph edit distance
- distance metric
- pattern recognition
- optimal solution
- similarity join
- data structure
- feature selection