Constructing level-2 phylogenetic networks from triplets

L. van Iersel, J. Keijsper, S. Kelk, L. Stougie, F. Hagen, T. Boekhout

    Onderzoeksoutput: Bijdrage aan wetenschappelijk tijdschrift/periodieke uitgaveArtikelWetenschappelijkpeer review

    Samenvatting

    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.
    Originele taal-2Engels
    Pagina's (van-tot)667-681
    TijdschriftIEEE/ACM Transactions on Computational Biology and Bioinformatics
    Volume6
    Nummer van het tijdschrift4
    DOI's
    StatusGepubliceerd - 2009

    Vingerafdruk

    Duik in de onderzoeksthema's van 'Constructing level-2 phylogenetic networks from triplets'. Samen vormen ze een unieke vingerafdruk.

    Citeer dit