< Back to Article

Species Tree Inference by Minimizing Deep Coalescences

Figure 16

Illustration of our method.

A A weighted compatibility graph is constructed from the clusters of the input gene trees (T1, T2, and T3). Shown at the bottom are all maximal cliques, along with their weights (the sum of weights of their vertices), of which the three heaviest maximal cliques are highlighted. B A table showing the calculation of the weight of each vertex in the compatibility graph, where in each row v is the vertex that corresponds to the cluster in that row, and w(v) = m+1−(α(C, T1)+α(C,T2)+α(C,T3)) (m = 2 in this case).

Figure 16