A short note on the tractability of constructing phylogenetic networks from clusters

Details A short note on the tractability of constructing phylogenetic networks from clusters A short note on the tractability of constructing phylogenetic networks from clusters

2009-12-22

arxiv.org/abs/0912.4502v1

Biology

Quantitative Biology

Populations and Evolution

Scientific paper

In [2] it was proven that the Cass algorithm is a polynomial-time algorithm for constructing level<=2 networks from clusters. Here we demonstrate, for each k>=0, a polynomial-time algorithm for constructing level-k phylogenetic networks from clusters. Unlike Cass the algorithm scheme given here is only of theoretical interest. It does, however, strengthen the hope that efficient polynomial-time algorithms (and perhaps fixed parameter tractable algorithms) exist for this problem.

Affiliated with

Also associated with

No associations

Rating

A short note on the tractability of constructing phylogenetic networks from clusters 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 short note on the tractability of constructing phylogenetic networks from clusters, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A short note on the tractability of constructing phylogenetic networks from clusters will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-362178