Approximating Edit Distance in Near-Linear Time
Alexandr AndoniKrzysztof OnakPublished in: CoRR (2011)
Keyphrases
- edit distance
- string matching
- edit operations
- levenshtein distance
- distance measure
- graph matching
- similarity measure
- distance function
- approximate string matching
- worst case
- string similarity
- dynamic programming
- string edit distance
- tree structured data
- tree edit distance
- approximate matching
- graph edit distance
- similarity join
- finite alphabet
- suffix array
- longest common subsequence
- data sets
- dissimilarity measure
- vector space
- high dimensional
- feature selection