Edit Distance Cannot Be Computed in Strongly Subquadratic Time (unless SETH is false).
Arturs BackursPiotr IndykPublished in: CoRR (2014)
Keyphrases
- edit distance
- normalized edit distance
- edit operations
- graph matching
- similarity measure
- string matching
- levenshtein distance
- approximate string matching
- string edit distance
- distance function
- tree structured data
- dynamic programming
- distance measure
- dynamic time warping
- graph edit distance
- dissimilarity measure
- distance computation
- tree edit distance
- finite alphabet
- optimal solution
- longest common subsequence
- approximate matching
- subgraph isomorphism
- similarity join
- privacy preserving
- high dimensional