Edit Distance Cannot Be Computed in Strongly Subquadratic Time (unless SETH is false).
Arturs BackursPiotr IndykPublished in: STOC (2015)
Keyphrases
- edit distance
- normalized edit distance
- graph matching
- similarity measure
- string matching
- edit operations
- string similarity
- levenshtein distance
- approximate string matching
- graph edit distance
- string edit distance
- tree edit distance
- distance measure
- distance function
- dynamic time warping
- dissimilarity measure
- subgraph isomorphism
- approximate matching
- distance computation
- longest common subsequence
- tree structured data
- dynamic programming
- pairwise
- machine learning
- pattern recognition
- data analysis
- high dimensional