SPICi:&nbsp&nbsp Speed and Performance In Clustering

SPICi (pronounced "spicy") is a fast local network clustering algorithm.
SPICi runs in time O(Vlog V +E) and space O(E), where V and E are the number of vertices and edges in the network.
It also has state-of the-art performance with respect to the quality of the clusters it uncovers.
The source code of SPICi could be found in Downloads section; or you could try it online with the form below.
The help content of each field will be displayed upon mouse over.

Upload your network

minimum cluster density [0-1]

minimum support threshold [0-1]

minimum cluster size

Graph mode

&nbsp&nbsp&nbsp 0: sparse graph

&nbsp&nbsp&nbsp 1: dense graph

&nbsp&nbsp&nbsp 2: large sparse graph

Input: Each line represents one edge in the format of ID_A&nbsp ID_B&nbsp weight, separated by space or tab.
Example:
A&nbsp B&nbsp 0.7
C&nbsp D&nbsp 0.9
...Output: Each line represents a cluster. Gene names are separated by tab.