Efficiently Approximating Edit Distance Between Pseudorandom Strings.
William KuszmaulPublished in: SODA (2019)
Keyphrases
- edit distance
- pseudorandom
- string matching
- edit operations
- graph matching
- similarity measure
- string edit distance
- string similarity
- approximate string matching
- levenshtein distance
- distance function
- finite alphabet
- distance measure
- dynamic time warping
- approximate matching
- graph edit distance
- longest common subsequence
- normalized edit distance
- uniformly distributed
- tree structured data
- secret key
- hamming distance
- tree edit distance
- dynamic programming
- similarity join
- distance computation
- neural network
- subgraph isomorphism
- low cost
- nearest neighbor
- high dimensional