Figure 1From: Efficient algorithms for reconciling gene trees and species networks via duplication and loss events( a ) An example of a level-2 network N , ( b ) the tree bc ( N ), (c) a switching of N where the switched-off edges are dotted, (d) a network N' such that M N ′ x , y = { m 1 , m 2 , m 3 } , (e) another switching of a network. Note that the edge (a; b) will also be switched off since all out-going edges of b are off.Back to article page