Skip to main content
Figure 9 | BioData Mining

Figure 9

From: Using graph theory to analyze biological networks

Figure 9

Matching Index. V 1 is connected with 5 nodes (V 3 , V 4 , V 6 , V 7, V 8 ). V 2 is connected with 4 nodes (V 3 , V 4 , V 5 , V 8 ). V 3 is connected with 2 nodes (V 1 , V 2 ). V 4 is connected with 3 nodes (V 1 , V 2 ). V 5 is connected with 1 node (V 2 ). V 6 is connected with 1 node (V 1 ). V 7 is connected with 1 node (V 1 ). V 8 is connected with 2 nodes (V 1 , V 5 ). Node V 1 and V 2 are connected with 3 common nodes (V 3 , V 4 , V 8 ) and in total with 6 distinct neighbors (V 3 , V 4 , V 8 , V 5 , V 6 , V 7 ). The matching index will then be M1,2 = 3/6 = 0.5, thus V 1 and V 2 are functionally similar even though they are not connected.

Back to article page