Please use this identifier to cite or link to this item:
|Title:||Constructing a smallest refining galled phylogenetic network||Authors:||Huynh, T.N.D.
|Issue Date:||2005||Citation:||Huynh, T.N.D.,Jansson, J.,Nguyen, N.B.,Sung, W.-K. (2005). Constructing a smallest refining galled phylogenetic network. Lecture Notes in Bioinformatics (Subseries of Lecture Notes in Computer Science) 3500 : 265-280. ScholarBank@NUS Repository.||Abstract:||Reticulation events occur frequently in many types of species. Therefore, to develop accurate methods for reconstructing phylogenetic networks in order to describe evolutionary history in the presence of reticulation events is important. Previous work has suggested that constructing phylogenetic networks by merging gene trees is a biologically meaningful approach. This paper presents two new efficient algorithms for inferring a phylogenetic network from a set T of gene trees of arbitrary degrees. The first algorithm solves the open problem of constructing a refining galled network for T (if one exists) with no restriction on the number of hybrid nodes; in fact, it outputs the smallest possible solution. In comparison, the previously best method (SpNet) can only construct networks having a single hybrid node. For cases where there exists no refining galled network for T, our second algorithm identifies a minimum subset of the species set to be removed so that the resulting trees can be combined into a galled network. Based on our two algorithms, we propose two general methods named RGNet and RGNet+. Through simulations, we show that our methods outperform the other existing methods neighbor-joining, NeighborNet, and SpNet. © Springer-Verlag Berlin Heidelberg 2005.||Source Title:||Lecture Notes in Bioinformatics (Subseries of Lecture Notes in Computer Science)||URI:||http://scholarbank.nus.edu.sg/handle/10635/40451||ISSN:||03029743|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.