Partitioning the Sample Space on Five Taxa for the Neighbor Joining Algorithm

In this paper, we will analyze the behavior of the Neighbor Joining algorithm on five taxa and we will show that the partition of the sample (data) space for estimation of a tree topology with five taxa into subspaces, within each of which the Neighbor Joining algorithm returns the same tree topology. A key of our method to partition the sample space is the action of the symmetric group S5 on the set of distance matrices by changing the labels of leaves. The method described in this paper can be generalized to trees with more than five taxa.