NeAT - MCL

Fast and scalable unsupervised cluster algorithm for graphs based on simulation of (stochastic) flow in graphs.
The MCL program was developed by Stijn van Dongen (Van Dongen, 2000, PhD thesis; Enright et al, 2002)
The stand-alone version of MCL is available at http://micans.org/mcl/
   Input format 

Comment on the demonstration example

This demonstration graph consists in the yeast co-immunopreciptation interaction dataset described in Gavin et al (2006). It contains 1430 nodes and 6531 edges. The MCL algorithm is applied on it in order to highlight clusters of densely connected polypeptides.
Graph

Upload graph from file :

   
Column specification (only relevant for tab-delimited input)
Source node
Target node
Weight or label column
Inflation value