)-approximating edit distance via indexing.
Bernhard HaeuplerAviad RubinsteinAmirbehshad ShahrasbiPublished in: STOC (2019)
Keyphrases
- edit distance
- string matching
- distance computation
- similarity measure
- edit operations
- graph matching
- approximate string matching
- distance measure
- levenshtein distance
- distance function
- dynamic programming
- information retrieval
- string similarity
- tree structured data
- dynamic time warping
- string edit distance
- tree edit distance
- graph edit distance
- indexing method
- dissimilarity measure
- triangle inequality
- indexing techniques
- computer vision
- adjacency matrix
- subgraph isomorphism
- similarity join
- access methods
- approximate matching
- longest common subsequence
- pairwise
- finite alphabet
- feature extraction