Constructing the simplest possible phylogenetic network from triplets

L.J.J. Iersel, van, S.M. Kelk

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

3 Citations (Scopus)

Abstract

A phylogenetic network is a directed acyclic graph that visualises an evolutionary history containing so-called reticulations such as recombinations, hybridisations or lateral gene transfers. Here we consider the construction of a simplest possible phylogenetic network consistent with an input set T, where T contains at least one phylogenetic tree on three leaves (a triplet) for each combination of three taxa. To quantify the complexity of a network we consider both the total number of reticulations and the number of reticulations per biconnected component, called the level of the network. We give polynomial-time algorithms for constructing a level-1 respectively a level-2 network that contains a minimum number of reticulations and is consistent with T (if such a network exists). In addition, we show that if T is precisely equal to the set of triplets consistent with some network, then we can construct such a network, which minimises both the level and the total number of reticulations, in time O(|T|k+1), if k is a fixed upper bound on the level.
Original languageEnglish
Title of host publicationAlgorithms and Computation (Proceedings 19th International Symposium, ISAAC 2008, Gold Coast, Australia, December 15-17, 2008)
EditorsS.H. Hong, H. Nagamochi, T. Fukunaga
Place of PublicationBerlin
PublisherSpringer
Pages472-483
ISBN (Print)978-3-540-92181-3
DOIs
Publication statusPublished - 2008

Publication series

NameLecture Notes in Computer Science
Volume5369
ISSN (Print)0302-9743

Fingerprint Dive into the research topics of 'Constructing the simplest possible phylogenetic network from triplets'. Together they form a unique fingerprint.

Cite this