Nothing
Implements a knearest neighbor search based on preclustering with the kmeans algorithm, as described by Wang (2012). This is faster than conventional kdtrees for neighbor searching in higher (> 20) dimensional data. Functions are also provided to search for all neighbors within a given distance. Parallelization is achieved using the BiocParallel framework.
Package details 


Author  Aaron Lun [aut, cre, cph] 
Bioconductor views  Classification Clustering 
Maintainer  Aaron Lun <alun@wehi.edu.au> 
License  GPL3 
Version  0.99.16 
Package repository  View on Bioconductor 
Installation 
Install the latest version of this package by entering the following in R:

Any scripts or data that you put into this service are public.
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.