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 [18]. 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 non-tree 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. © 2008 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Van Iersel, L., Keijsper, J., Kelk, S., Stougie, L., Hagen, F., & Boekhout, T. (2008). Constructing level-2 phylogenetic networks from triplets. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4955 LNBI, pp. 450–462). https://doi.org/10.1007/978-3-540-78839-3_40
Mendeley helps you to discover research relevant for your work.