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

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

2007-03-03

arxiv.org/abs/math/0703081v1

Mathematics

Combinatorics

12 pages

Scientific paper

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 $S_5$ 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.

Affiliated with

Also associated with

No associations

Rating

Partitioning the Sample Space on Five Taxa for the Neighbor Joining Algorithm does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Partitioning the Sample Space on Five Taxa for the Neighbor Joining Algorithm, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Partitioning the Sample Space on Five Taxa for the Neighbor Joining Algorithm will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-719951