Constructing a Smallest Refining Galled Phylogenetic Network

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...

• Type: Conference
• Year: 2005
• Where: RECOMB
• Authors: Trinh N. D. Huynh, Jesper Jansson, Nguyen Bao Nguyen, Wing-Kin Sung
• Keywords: Computational Biology, RECOMB 2005, Refining Galled Network, Single Hybrid Node, Smallest Possible Solution