Showing 4 of total 4 results (show query)
jefferislab
RANN:Fast Nearest Neighbour Search (Wraps ANN Library) Using L2 Metric
Finds the k nearest neighbours for every point in a given dataset in O(N log N) time using Arya and Mount's ANN library (v1.1.3). There is support for approximate as well as exact searches, fixed radius searches and 'bd' as well as 'kd' trees. The distance is computed using the L2 (Euclidean) metric. Please see package 'RANN.L1' for the same functionality using the L1 (Manhattan, taxicab) metric.
Maintained by Gregory Jefferis. Last updated 7 months ago.
ann-librarynearest-neighborsnearest-neighbourscpp
55.5 match 58 stars 12.21 score 1.3k scripts 190 dependentspaulnorthrop
donut:Nearest Neighbour Search with Variables on a Torus
Finds the k nearest neighbours in a dataset of specified points, adding the option to wrap certain variables on a torus. The user chooses the algorithm to use to find the nearest neighbours. Two such algorithms, provided by the packages 'RANN' <https://cran.r-project.org/package=RANN>, and 'nabor' <https://cran.r-project.org/package=nabor>, are suggested.
Maintained by Paul J. Northrop. Last updated 2 years ago.
degreesdonutedgesknn-algorithmknn-searchnabornearestnearest-neighbornearest-neighbor-searchnearest-neighborsnearest-neighbour-algorithmnearest-neighboursneighborsperiodicityranntoruswrap
11.8 match 1 stars 4.18 score 5 scripts 1 dependentsgfellerlab
SuperCell:Simplification of scRNA-seq data by merging together similar cells
Aggregates large single-cell data into metacell dataset by merging together gene expression of very similar cells.
Maintained by The package maintainer. Last updated 8 months ago.
softwarecoarse-grainingscrna-seq-analysisscrna-seq-data
1.7 match 72 stars 8.08 score 93 scriptsjefferis
nabor:Wraps 'libnabo', a Fast K Nearest Neighbour Library for Low Dimensions
An R wrapper for 'libnabo', an exact or approximate k nearest neighbour library which is optimised for low dimensional spaces (e.g. 3D). 'libnabo' has speed and space advantages over the 'ANN' library wrapped by package 'RANN'. 'nabor' includes a knn function that is designed as a drop-in replacement for 'RANN' function nn2. In addition, objects which include the k-d tree search structure can be returned to speed up repeated queries of the same set of target points.
Maintained by Gregory Jefferis. Last updated 5 years ago.
0.8 match 22 stars 8.21 score 104 scripts 34 dependents