Amos Tanay's Group High Performance Statistical Utilities
Builds directed graph of correlations
Returns k highest values of each column
Calculates correlation or auto-correlation
Calculates distances between the matrix rows
Checks whether all the elements of the vector are finite
Clusters directed graph multiple times with randomized sample subset
Clusters directed graph
For each matrix row apply a function over a ragged array
tgstat: Amos Tanay's Group High Performance Statistical Utilities
A collection of high performance utilities to compute distance, correlation, auto correlation, clustering and other tasks. Contains graph clustering algorithm described in "MetaCell: analysis of single-cell RNA-seq data using K-nn graph partitions" (Yael Baran, Akhiad Bercovich, Arnau Sebe-Pedros, Yaniv Lubling, Amir Giladi, Elad Chomsky, Zohar Meir, Michael Hoichman, Aviezer Lifshitz & Amos Tanay, 2019 <doi:10.1186/s13059-019-1812-2>).