Skip to main content

Table 5 Graph analysis

From: HomoMINT: an inferred human network based on orthology mapping of protein interactions discovered in model organisms

Data set

Nodes (N)

Edges* (L)

Clust. coeff. 1

MPL2

<k> 3

d_LCC4

HomoMINT

4067

9132

0.04

4.9

4.73

12

HEN

4933

22124

0.16

4.5

9.4

15

C. elegans

2834

4406

0.02

4.8

3.2

13

D. melanogaster

7005

20282

0.01

4.4

5.8

11

S. cerevisiae

4584

12055

0.07

4.4

5.3

12

Random2000 #

1989

5047

0.002

4.8

5.0

11

Random5000 #

4893

9935

0.001

6.2

4.0

13

  1. *Number of edges may be different from those reported in Table 2 because in this analysis we have neglected interactions leading to homodimerization.
  2. #Random2000 and Random5000 are random networks with approximately 2000 and 5000 nodes.
  3. 1Average of the clustering coefficient of the nodes in the network.
  4. 2MPL is the average of the minimal path length between two nodes of the graph.
  5. 3<k> is the average number of connections per nodes in the graph.
  6. 4d_LCC is the diameter of the largest connected component of the graph