NeAT - graph-get-clusters

Compares a graph with a classification/clustering file.
This program was developed by Sylvain Brohée and Jacques van Helden.
Graph
   Input format 

Comment on the demonstration example

This demonstration consists in the comparaison of the yeast co-immunoprecipitation interaction dataset from Gavin (2006) with the clusters produced by the MCL algorithm (inflation 2.1)
Graph

Upload graph from file :

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



Clusters (or list of nodes in case of induced graph)

Upload clusters (or nodes for induction) from file :

Output type 

Output format (not relevant for node-cluster connection output format)