NeAT - graph-cluster-membership

Map a clustering result onto a graph, and compute the membership degree between each node and each cluster, on the basis of egdes linking this node to the cluster.
This program was developed by Gipsi Lima-Mendez With the help of: Sylvain Brohée and Jacques van Helden.
Graph
   Input format 

Comment on the demonstration example

This demonstration consists on mapping of the clusters produced by the MCL algorithm (inflation 2.1) of the yeast co-immunoprecipitation interaction dataset from Gavin (2006) onto the corresponding graph
Graph

Upload graph from file :

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



Clusters

Upload clusters from file :



Membership Matrix
   Stat 

    Number of Decimals
    RESET DEMO MANUAL MAIL