Who is Who in Phylogenetic Networks

Publication no #686   Type :   Html | Bib | Both

Created: 2009-03-13 08:42:45     Modified: 2015-07-27 17:59:34

686 Daniel H. Huson, Regula Rupp, Vincent Berry, Philippe Gambette and Christophe Paul. Computing Galled Networks from Real Data. In ISMBECCB09, Vol. 25(12):i85-i93 of BIO, 2009. Keywords: abstract network, cluster containment, explicit network, FPT, from clusters, from rooted trees, galled network, NP complete, phylogenetic network, phylogeny, polynomial, Program Dendroscope, reconstruction. Note: http://hal-lirmm.ccsd.cnrs.fr/lirmm-00368545/en/.         Toggle abstract "Motivation: Developing methods for computing phylogenetic networks from biological data is an important problem posed by molecular evolution and much work is currently being undertaken in this area. Although promising approaches exist, there are no tools available that biologists could easily and routinely use to compute rooted phylogenetic networks on real datasets containing tens or hundreds of taxa. Biologists are interested in clades, i.e. groups of monophyletic taxa, and these are usually represented by clusters in a rooted phylogenetic tree. The problem of computing an optimal rooted phylogenetic network from a set of clusters, is hard, in general. Indeed, even the problem of just determining whether a given network contains a given cluster is hard. Hence, some researchers have focused on topologically restricted classes of networks, such as galled trees and level-k networks, that are more tractable, but have the practical draw-back that a given set of clusters will usually not possess such a representation. Results: In this article, we argue that galled networks (a generalization of galled trees) provide a good trade-off between level of generality and tractability. Any set of clusters can be represented by some galled network and the question whether a cluster is contained in such a network is easy to solve. Although the computation of an optimal galled network involves successively solving instances of two different NP-complete problems, in practice our algorithm solves this problem exactly on large datasets containing hundreds of taxa and many reticulations in seconds, as illustrated by a dataset containing 279 prokaryotes. © 2009 The Author(s)." @InProceedings{HRBGP2009,       AUTHOR = {Huson, Daniel H. and Rupp, Regula and Berry, Vincent and Gambette, Philippe and Paul, Christophe},       TITLE = {Computing Galled Networks from Real Data},       YEAR = {2009},       BOOKTITLE = {ISMBECCB09},       VOLUME = {25},       NUMBER = {12},       PAGES = {i85-i93},       SERIES = {BIO},       URL = {http://dx.doi.org/10.1093/bioinformatics/btp217},       NOTE = {http://hal-lirmm.ccsd.cnrs.fr/lirmm-00368545/en/},       ANNOTE = {BIBUPDATE : 20090312},       KEYWORDS = {abstract network, cluster containment, explicit network, FPT, from clusters, from rooted trees, galled network, NP complete, phylogenetic network, phylogeny, polynomial, Program Dendroscope, reconstruction} }