BK-tree

A BK-tree is a metric tree suggested by Walter Austin Burkhard and Robert M. Keller specifically adapted to discrete metric spaces. For simplicity, let us consider integer discrete metric d(x,y). Then, BK-tree is defined in the following way. An arbitrary element a is selected as root node. The root node may have zero or more subtrees. The k-th subtree is recursively built of all elements b such that d(a,b) = k. BK-trees can be used for approximate string matching in a dictionary .

See also

References

External links


This article is issued from Wikipedia - version of the Wednesday, September 23, 2015. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.