DISTIQUE uses double anchored matrices, which can be each computed in Θ(n 2 k). It uses multiple anchors and combines the trees or matrices produced by different anchors. A careful selection of anchors can ensure the final DISTIQUE tree includes all species, and can control its running time between Θ(n 2 k) and Θ(n 4 k). Before presenting our anchoring strategy, we first need to show how DISTIQUE deals with long branches.