Table 1 Summary of metrics or scores
Symbol | Description |
|---|---|
PPINs | Protein-protein interaction networks |
G=(V,E) | Graph G with vertex set V, edge set E and W is weight matrix |
N | Number of vertices in a graph |
M | Number of edges in a graph |
v | A vertex in V |
(v,u) | Edge between vertices v and u in E |
N(v) | N(v) stands for the set of all vertex v’neighbors |
CN(v,u) | The weight of edge (v,u) according to common neighbors (CN) namely, Eq. (7) |
GO(v,u) | The weight of edge (v,u) according to Gene Ontology (GO) namely, Eq.(8) |
w(v,u) | The weight of edge (v,u) according to both CN(v,u) and GO(v,u), see Eq. (9) |
dw(v) | The weight degree of vertex v |
NGCC(v) | The Neighborhood Graph Clustering Coefficient of vertex v |
Score(v) | The priority of vertex v is used as seed according to Eq. (12) |
SG | A subgraph in Graph G |
D(SG) | The density of subgraph (SG) according to Eq. (13) |
M(SG) | The modularity of subgraph (SG) according to Eq. (16) |
F(SG) | The fitness of subgraph (SG) according to Eq. (17) |
Neighbor(SG) | The neighbor of the cluster SG |
inner_nodes(SG) | The inner nodes in the cluster SG |
weightavg(SG) | The average weighted interactions within the cluster SG according to Eq. (18) |