Edit Distance Cannot Be Computed in Strongly Subquadratic Time (Unless SETH is False).
Arturs BackursPiotr IndykPublished in: SIAM J. Comput. (2018)
Keyphrases
- edit distance
- normalized edit distance
- similarity measure
- graph matching
- edit operations
- distance function
- approximate string matching
- levenshtein distance
- distance measure
- string edit distance
- string matching
- dynamic programming
- approximate matching
- graph edit distance
- tree structured data
- string similarity
- tree edit distance
- longest common subsequence
- distance computation
- dissimilarity measure
- dynamic time warping
- similarity search
- data sets
- finite alphabet
- pattern recognition