Sets of double and triple weights of trees

Details Sets of double and triple weights of trees Sets of double and triple weights of trees

2007-12-18

arxiv.org/abs/0712.3026v3

Mathematics

Algebraic Geometry

11 pages, to appear in Annals of Combinatorics

Scientific paper

Let T be a weighted tree with n leaves. Let D_{i,j} be the distance between the leaves i and j. Let D_{i,j,k}= (D_{i,j} + D_{j,k} +D_{i,k})/2. We will call such numbers "triple weights" of the tree. In this paper, we give a characterization, different from the previous ones, for sets indexed by 2-subsets of a $n$-set to be double weights of a tree. By using the same ideas,we find also necessary and sufficient conditions for a set of real numbers indexed by 3-subsets of an $n$-set to be the set of the triple weights of a tree with $n$ leaves. Besides we propose a slight modification of Saitou-Nei's Neighbour-Joining algorithm to reconstruct trees from the data D_{i,j}.

Affiliated with

Also associated with

No associations

Rating

Sets of double and triple weights of trees 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 Sets of double and triple weights of trees, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Sets of double and triple weights of trees will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-549916