Damn Cool Algorithms, Part 1: BK-Trees - Nick's Blog

Posted by Nick Johnson | Filed under tech, coding, damn-cool-algorithms This is the first post in (hopefully) a series of posts on Damn Cool Algorithms - essentially, any algorithm I think is really Damn Cool, particularly if it's simple but non-obvious. BK-Trees, or Burkhard-Keller Trees are a tree-based data structure engineered for quickly finding near-matches to a string, for example, as used

[suffixarray]

BK-tree

[okagawa]

BK-tree。高速検索に適したデータ構造。