Skip to main content
Fig. 1 | Algorithms for Molecular Biology

Fig. 1

From: Statistically consistent divide-and-conquer pipelines for phylogeny estimation using NJMerge

Fig. 1

NJMerge input/output example. In this example, NJMerge is given two constraint trees (\(T_i\) and \(T_j\)) and a distance matrix \(D^{ij}\) that is additive for the tree (((A, B), (C, D)), E, (F, (G, H))). NJMerge returns a compatibility supertree, called \(T_{ij}\), for the two constraint trees (\(T_i\) and \(T_j\)). Note that Neighbor Joining (NJ) applied to the distance matrix \(D^{ij}\) would return (((A, B), (C, D)), E, (F, (G, H))) [37]; however, NJMerge rejects the siblinghood proposal (G, H), because it violates constraint tree \(T_j\). Instead, NJMerge makes G and F siblings

Back to article page
\