Almost-Optimal Sublinear-Time Edit Distance in the Low Distance Regime.
Karl BringmannAlejandro CassisNick FischerVasileios NakosPublished in: CoRR (2022)
Keyphrases
- edit distance
- distance measure
- string edit distance
- distance function
- distance computation
- tree edit distance
- levenshtein distance
- hamming distance
- triangle inequality
- dynamic programming
- triangular inequality
- string matching
- edit operations
- similarity measure
- string similarity
- cosine distance
- dissimilarity measure
- approximate string matching
- graph edit distance
- longest common subsequence
- binary search trees
- graph matching
- euclidean distance
- machine learning
- approximate matching
- tree structured data
- approximation algorithms
- distance metric
- similarity search
- optimal solution
- feature selection
- neural network
- normalized edit distance