Iersel van, L. and Keijsper, J. and Kelk, S. and Stougie, L. and Hagen, F. and Boekhout, T. (2009) Constructing level-2 phylogenetic networks from triplets. IEEE/ACM Transactions on Computational Biology and Bioinformatics, 6, 667-681. ISSN 1557-9964.
Full text not available from this repository.
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 . 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.
|Institutes:||Centraalbureau voor Schimmelcultures (CBS)|
|Deposited On:||27 Jan 2010 01:00|
|Last Modified:||03 Aug 2010 15:25|
Repository Staff Only: item control page