Figure 1.

Network alignment a. A dashed arrow from a node i V1 from the first network G1 = (V1, E1) to a node j V2 from the second network G2 = (V2, E2) indicates that a(i) = j. Unmapped vertices are mapped to gaps. The score of the alignment depends on the values given in σ and τ. For simplicity, we assume that σ(i, j) = 1 for all i V1 and j V2 and that τ(i, j, k, l) = 1 if (i, k) ∈ E1 and (j, l) ∈ E2 and τ(i, j, k, l) = 0 otherwise. This leads to a score of 4 + 5 = 9 in the example.

Klau BMC Bioinformatics 2009 10(Suppl 1):S59   doi:10.1186/1471-2105-10-S1-S59