Quartet consistency count method for reconstructing phylogenetic trees

Details Quartet consistency count method for reconstructing phylogenetic trees Quartet consistency count method for reconstructing phylogenetic trees

2006-10-11

arxiv.org/abs/q-bio/0610020v1

Biology

Quantitative Biology

Populations and Evolution

11 pages, 5 figures

Scientific paper

Among the distance based algorithms in phylogenetic tree reconstruction, the neighbor-joining algorithm has been a widely used and effective method. We propose a new algorithm which counts the number of consistent quartets for cherry picking with tie breaking. We show that the success rate of the new algorithm is almost equal to that of neighbor-joining. This gives an explanation of the qualitative nature of neighbor-joining and that of dissimilarity maps from DNA sequence data. Moreover, the new algorithm always reconstructs correct trees from quartet consistent dissimilarity maps.

Affiliated with

Also associated with

No associations

Rating

Quartet consistency count method for reconstructing phylogenetic 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 Quartet consistency count method for reconstructing phylogenetic trees, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Quartet consistency count method for reconstructing phylogenetic trees will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-579550