Gain Summary.

The log table corresponding to the next iteration of the iteration shown in Figure 5. Here represents the step number. The input partition to step is (, ). The second column shows the taxon that has the maximum gain at the corresponding step, and the third column shows the corresponding maximum gain. We observe that the cumulative gain gets maximum () at step . So we rollback all the subsequent moves including the move at step and return the initial partition of this iteration as the resultant bipartition of the bipartition algorithm. No more iteration is needed as the maximum cumulative gain of the current iteration is not greater than zero.