Skip to main content
. 2020 Mar 3;10:3901. doi: 10.1038/s41598-020-60737-5

Figure 3.

Figure 3

L-HetNetAligner Algorithm: Construction of the Alignment Graph from the Input Graphs. Alignment Example: The Algorithm receives as input two heterogeneous networks and a set of similarity relationships among nodes of networks (green dashed lines). First, the algorithm builds the nodes of the heterogeneous alignment graph. Then edges are added on the basis of the analysis of input networks. The heterogeneous alignment graph has nodes coloured while edges are weighted and with a single colour.