@inproceedings{ab4dc156aa6040fc93fb49ae7c23a85b,
title = "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 [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. Part of this research has been funded by the Dutch BSIK/BRICKS project.",
author = "\{Iersel, van\}, L.J.J. and J.C.M. Keijsper and S.M. Kelk and L. Stougie and F. Hagen and T. Boekhout",
year = "2008",
doi = "10.1007/978-3-540-78839-3\_40",
language = "English",
isbn = "978-3-540-78838-6",
series = "Lecture Notes in Computer Science",
publisher = "Springer",
pages = "450--462",
editor = "M. Vingron and L. Wong",
booktitle = "Research in Computational Molecular Biology (Proceedings 12th Annual International Conference, RECOMB 2008, Singapore, March 30-April 2, 2008)",
address = "Germany",
}