Worst-case optimal approximation algorithms for maximizing triplet consistency within phylogenetic networks

Details Worst-case optimal approximation algorithms for maximizing triplet consistency within phylogenetic networks Worst-case optimal approximation algorithms for maximizing triplet consistency within phylogenetic networks

2007-10-17

arxiv.org/abs/0710.3258v3

Biology

Quantitative Biology

Populations and Evolution

A new version with heavily optimized derandomization running time. And a very fast triplet-consistency checking algorithm as s

Scientific paper

This article concerns the following question arising in computational evolutionary biology. For a given subclass of phylogenetic networks, what is the maximum value of 0 <= p <= 1 such that for every input set T of rooted triplets, there exists some network N(T) from the subclass such that at least p|T| of the triplets are consistent with N(T)? Here we prove that the set containing all triplets (the full triplet set) in some sense defines p, and moreover that any network N achieving fraction p' for the full triplet set can be converted in polynomial time into an isomorphic network N'(T) achieving >= p' for an arbitrary triplet set T. We demonstrate the power of this result for the field of phylogenetics by giving worst-case optimal algorithms for level-1 phylogenetic networks (a much-studied extension of phylogenetic trees), improving considerably upon the 5/12 fraction obtained recently by Jansson, Nguyen and Sung. For level-2 phylogenetic networks we show that p >= 0.61. We note that all the results in this article also apply to weighted triplet sets.

Affiliated with

Also associated with

No associations

Rating

Worst-case optimal approximation algorithms for maximizing triplet consistency within phylogenetic networks 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 Worst-case optimal approximation algorithms for maximizing triplet consistency within phylogenetic networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Worst-case optimal approximation algorithms for maximizing triplet consistency within phylogenetic networks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-11710