Figure 5.

Accuracy of GraphAlignment and Græmlin in scenarios (ii) and (iii). While GraphAlignment correctly decides between paralogous genes, Græmlin creates equivalence classes that include both paralogs and their respective partner in the other network. The introduction of spurious weak vertex similarities does not influence GraphAlignment performance, yet it prevents Græmlin from forming the appropriate equivalence classes.