phenoGraph: Find clusters by network modularity

Description

Description

This package implements the PhenoGraph algorithm, which first creates an adjacancy matrix according to k-nearest neighbours, and then uses the Louvain algorithm to identify "communities" by maximizing the modularity.

In general, the only function that needs to be run is phenoClust. Other functions are available as utilities.


yishaishimoni/phenoClust documentation built on Dec. 15, 2017, 3:05 a.m.