title: SuperQ: computing supernetworks from quartets.
abstract: Supertrees are a commonly used tool in phylogenetics to summarize collections of partial phylogenetic trees. As a generalization of supertrees, phylogenetic supernetworks allow, in addition, the visual representation of conflict between the trees that is not possible to observe with a single tree. Here, we introduce SuperQ, a new method for constructing such supernetworks (SuperQ is freely available at >www.uea.ac.uk/computing/superq.). It works by first breaking the input trees into quartet trees, and then stitching these together to form a special kind of phylogenetic network, called a split network. This stitching process is performed using an adaptation of the QNet method for split network reconstruction employing a novel approach to use the branch lengths from the input trees to estimate the branch lengths in the resulting network. Compared with previous supernetwork methods, SuperQ has the advantage of producing a planar network. We compare the performance of SuperQ to the Z-closure and Q-imputation supernetwork methods, and also present an analysis of some published data sets as an illustration of its applicability.
authors.affiliation: CAS-MPG Partner Institute for Computational Biology, Chinese Academy of Sciences, Shanghai, China. stefan@picb.ac.cn
authors.forename: Stefan
authors.initials: S
authors.lastname: Grünewald
authors.forename: Andreas
authors.initials: A
authors.lastname: Spillner
authors.forename: Sarah
authors.initials: S
authors.lastname: Bastkowski
authors.forename: Anja
authors.initials: A
authors.lastname: Bögershausen
authors.forename: Vincent
authors.initials: V
authors.lastname: Moulton
mesh_terms: D019295:Computational Biology / Q000379:methods*; D030541:Databases, Genetic; D005800:Genes, Fungal; D017343:Genes, Plant; D008957:Models, Genetic; D010802:Phylogeny; D012984:Software