A New Quartet Tree Heuristic for Hierarchical Clustering

Details A New Quartet Tree Heuristic for Hierarchical Clustering A New Quartet Tree Heuristic for Hierarchical Clustering

2006-06-11

arxiv.org/abs/cs/0606048v1

Computer Science

Data Structures and Algorithms

22 pages, 14 figures

Scientific paper

We consider the problem of constructing an an optimal-weight tree from the 3*(n choose 4) weighted quartet topologies on n objects, where optimality means that the summed weight of the embedded quartet topologiesis optimal (so it can be the case that the optimal tree embeds all quartets as non-optimal topologies). We present a heuristic for reconstructing the optimal-weight tree, and a canonical manner to derive the quartet-topology weights from a given distance matrix. The method repeatedly transforms a bifurcating tree, with all objects involved as leaves, achieving a monotonic approximation to the exact single globally optimal tree. This contrasts to other heuristic search methods from biological phylogeny, like DNAML or quartet puzzling, which, repeatedly, incrementally construct a solution from a random order of objects, and subsequently add agreement values.

Affiliated with

Also associated with

No associations

Rating

A New Quartet Tree Heuristic for Hierarchical Clustering 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 A New Quartet Tree Heuristic for Hierarchical Clustering, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A New Quartet Tree Heuristic for Hierarchical Clustering will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-528547