NeAT - compare-graphs

Computes the intersection, the union or the difference between two graphs.
This program was developed by Sylvain Brohée, Gilles Vanderstocken and Jacques van Helden.

Comment on the demonstration example

In this demonstration, we will compare the networks resulting from the two first publications reporting a complete characterization of the yeast interactome, obtained using the two-hybrid method.The first network (Uetz et al, 2000) contains 865 interactions between 926 proteins.The second network (Ito et al, 2001) contains 786 interactions between 779 proteins.We will merge the two networks (i.e. compute their union), and label each edge according to the fact that it is found only in Ito's network, only in Uetz' network, or in both. We will also compute the statistical significance of the intersection between the two networks.

Query graphReference graph
Input format 
Input format 
Upload query graph from file :
Upload reference graph from file :
Column specification (only relevant for tab-delimited input)
Source node
Target node
Weight or label column
Column specification (only relevant for tab-delimited input)
Source node
Target node
Weight or label column


Output type