Efficiently Approximating Edit Distance Between Pseudorandom Strings.
William KuszmaulPublished in: CoRR (2018)
Keyphrases
- edit distance
- pseudorandom
- edit operations
- approximate string matching
- similarity measure
- string matching
- levenshtein distance
- graph matching
- distance measure
- string similarity
- distance function
- uniformly distributed
- string edit distance
- dynamic time warping
- distance computation
- approximate matching
- secret key
- tree structured data
- normalized edit distance
- hamming distance
- dynamic programming
- tree edit distance
- similarity join
- longest common subsequence
- finite alphabet
- matching algorithm
- computer vision
- data sets