Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Constructing level-2 phylogenetic networks from triplets.

Constructing level-2 phylogenetic networks from triplets. Jansson and Sung showed that, given a dense set of input triplets T (representing hypotheses about the local evolutionary relationships of triplets of taxa), it is possible to determine in polynomial time whether there exists a level-1 network consistent with T, and if so, to construct such a network [24]. Here, we extend this work by showing that this problem is even polynomial time solvable for the construction of level-2 networks. This shows that, assuming density, it is tractable to construct plausible evolutionary histories from input triplets even when such histories are heavily nontree-like. This further strengthens the case for the use of triplet-based methods in the construction of phylogenetic networks. We also implemented the algorithm and applied it to yeast data. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png IEEE/ACM transactions on computational biology and bioinformatics Pubmed

Constructing level-2 phylogenetic networks from triplets.

IEEE/ACM transactions on computational biology and bioinformatics , Volume 6 (4): 15 – Feb 17, 2010

Constructing level-2 phylogenetic networks from triplets.


Abstract

Jansson and Sung showed that, given a dense set of input triplets T (representing hypotheses about the local evolutionary relationships of triplets of taxa), it is possible to determine in polynomial time whether there exists a level-1 network consistent with T, and if so, to construct such a network [24]. Here, we extend this work by showing that this problem is even polynomial time solvable for the construction of level-2 networks. This shows that, assuming density, it is tractable to construct plausible evolutionary histories from input triplets even when such histories are heavily nontree-like. This further strengthens the case for the use of triplet-based methods in the construction of phylogenetic networks. We also implemented the algorithm and applied it to yeast data.

Loading next page...
 
/lp/pubmed/constructing-level-2-phylogenetic-networks-from-triplets-QpVftY1nAt

References

References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.

ISSN
1545-5963
DOI
10.1109/TCBB.2009.22
pmid
19875864

Abstract

Jansson and Sung showed that, given a dense set of input triplets T (representing hypotheses about the local evolutionary relationships of triplets of taxa), it is possible to determine in polynomial time whether there exists a level-1 network consistent with T, and if so, to construct such a network [24]. Here, we extend this work by showing that this problem is even polynomial time solvable for the construction of level-2 networks. This shows that, assuming density, it is tractable to construct plausible evolutionary histories from input triplets even when such histories are heavily nontree-like. This further strengthens the case for the use of triplet-based methods in the construction of phylogenetic networks. We also implemented the algorithm and applied it to yeast data.

Journal

IEEE/ACM transactions on computational biology and bioinformaticsPubmed

Published: Feb 17, 2010

There are no references for this article.