CSDL Home IEEE/ACM Transactions on Computational Biology and Bioinformatics 2011 vol.8 Issue No.03 - May/June
Issue No.03 - May/June (2011 vol.8)
Katharina T. Huber , University of East Anglia, Norwich
Leo van Iersel , University of Canterbury, Christchurch
Steven Kelk , Centrum voor Wiskunde en Informatica (CWI), Amsterdam
Radosław Suchecki , University of East Anglia, Norwich
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TCBB.2010.17
Recently, much attention has been devoted to the construction of phylogenetic networks which generalize phylogenetic trees in order to accommodate complex evolutionary processes. Here, we present an efficient, practical algorithm for reconstructing level-1 phylogenetic networks—a type of network slightly more general than a phylogenetic tree—from triplets. Our algorithm has been made publicly available as the program Lev1athan. It combines ideas from several known theoretical algorithms for phylogenetic tree and network reconstruction with two novel subroutines. Namely, an exponential-time exact and a greedy algorithm both of which are of independent theoretical interest. Most importantly, Lev1athan runs in polynomial time and always constructs a level-1 network. If the data are consistent with a phylogenetic tree, then the algorithm constructs such a tree. Moreover, if the input triplet set is dense and, in addition, is fully consistent with some level-1 network, it will find such a network. The potential of Lev1athan is explored by means of an extensive simulation study and a biological data set. One of our conclusions is that Lev1athan is able to construct networks consistent with a high percentage of input triplets, even when these input triplets are affected by a low to moderate level of noise.
Phylogenetic networks, level-1, triplets, polynomial time.
Katharina T. Huber, Leo van Iersel, Steven Kelk, Radosław Suchecki, "A Practical Algorithm for Reconstructing Level-1 Phylogenetic Networks", IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol.8, no. 3, pp. 635-649, May/June 2011, doi:10.1109/TCBB.2010.17