Approximate Nearest Neighbors and Sequence Comparison With Block Operations (2000) [35 citations — 4 self]
Popular Tags
No tags have been applied to this document.
BibTeX | Add To MetaCart
author = {S. Muthukrishnan and Suleyman Cenk Sahinalp and Suleyman Cenk S},
title = {Approximate Nearest Neighbors and Sequence Comparison With Block Operations},
booktitle = {In STOC},
year = {2000},
pages = {416--424}
}
Years of Citing Articles
Bookmarks
OpenURL
Abstract:
We study sequence nearest neighbors (SNN). Let D be a database of n sequences; we would like to preprocess D so that given any on-line query sequence Q we can quickly find a sequence S in D for which d(S; Q) d(S; T ) for any other sequence T in D. Here d(S; Q) denotes the distance between sequences S and Q, defined to be the minimum number of edit operations needed to transform one to another (all edit operations will be reversible so that d(S; T ) = d(T; S) for any two sequences T and S). These operations correspond to the notion of similarity between sequences that we wish to capture in a given application. Natural edit operations include character edits (inserts, replacements, deletes etc), block edits (moves, copies, deletes, reversals) and block numerical transformations (scaling by an additive or a multiplicative constant). The SNN problem arises in many applications. We present the first known efficient algorithm for "approximate" nearest neighbor search for sequences with p...
