Figure 6From: A practical O(n log2 n) time algorithm for computing the triplet distance on binary treesAlgorithm for constructing the hierarchical decomposition tree. Algorithm for constructing the hierarchical decomposition tree. The listing shows the algorithm run for each level of the HDT construction. This algorithm is repeated until the es list is empty.Back to article page