Skip to main content
Fig. 2 | BMC Genomics

Fig. 2

From: Unblended disjoint tree merging using GTM improves species tree estimation

Fig. 2

GTM example with two constraint trees (or one recursive step). Green and blue edges lie inside different constraint sets. 1 We first collapse all edges that violate convexity (red) or violate a constraint tree (yellow). 2 At the polytomy where green and blue edges meet, we separate the green and blue edges with bridge e (pink). 3 We randomly select one edge (dashed) at each endpoint of the bridge. 4 We locate the edges in the constraint trees that induce the same bipartition, when restricted to their respective constraint set (in this case - A1A2A3|A4A5A6A7 and B1|B2B3B4). 5 We join the constraint trees by subdividing the two identified edges (i.e., by adding a new internal node into each edge) and add the edge between the newly created internal nodes

Back to article page