Login / Signup
A sublinear algorithm for weakly approximating edit distance.
Tugkan Batu
Funda Ergün
Joe Kilian
Avner Magen
Sofya Raskhodnikova
Ronitt Rubinfeld
Rahul Sami
Published in:
STOC (2003)
Keyphrases
</>
similarity measure
edit distance
dynamic programming
learning algorithm
levenshtein distance
computational complexity
string matching
np hard
worst case
matching algorithm
distance function
tree structure
similarity function