Figure 7From: Local search for the generalized tree alignment problemTree search algorithm comparison. Comparative performance of Union-pruning, and branch length sorting, with randomized algorithms in TBR. Union-TBR is the length sorted edge break + Union-pruning. TBR is length sorted edge break + randomized edge break and edge join ordering. Rand-Union-TBR is a randomized edge break + Union-pruning. Rand-TBR is randomized edge break and edge join.Back to article page