Figure 2.

Main steps of the L-HetNetAligner algorithm. In the first step the algorithm integrates two input networks into a single weighted alignment graph. In the second step communities are extracted from the alignment graph. Each community represents a region of local alignment.