Fig. 1From: Constrained incremental tree building: new absolute fast converging phylogeny estimation methods with improved scalability and accuracyHow the insertion ordering is computed. We show the threshold graph \(TG(D,\infty )\) and a minimum spanning tree S in red. A possible insertion ordering produced by a BFS on S starting at e is e, a, c, d, bBack to article page