Accurate and Scalable Techniques for the Complex/Pathway Membership Problem in Protein Networks

Figure 5

Construction of a cluster graph. Four clusters and a source node, the black circle, are shown. The weight of the edge between two gray clusters is computed by the maximum weight edge between their members in the original network (shown on the left). In the original network, there are three edges with weights a, b, and c between the seven nodes in each cluster. In the cluster network, an edge is put between these two clusters because there exists at least one pair of proteins in separate clusters that interact. The weight of this edge is the maximum of a, b, and c.