Constructing phylogenetic supernetworks from quartets

Item Type:	Article
Title:	Constructing phylogenetic supernetworks from quartets
Creators Name:	Grünewald, S. and Spillner, A. and Forslund, K. and Moulton, V.
Abstract:	In phylogenetics it is common practice to summarize collections of partial phylogenetic trees in the form of supertrees. Recently it has been proposed to construct phylogenetic supernetworks as an alternative to supertrees as these allow the representation of conflicting information in the trees, information that may not be representable in a single tree. Here we introduce SuperQ, a new method for constructing such supernetworks. It works by breaking the input trees into quartet trees, and stitching together the resulting set to form a network. The stitching process is performed using an adaptation of the QNet method for phylogenetic network reconstruction. In addition to presenting the new method, we illustrate the applicability of SuperQ to three data sets and discuss future directions for testing and development.
Keywords:	Phylogenetic Network, Partial Tree, Input Tree, Split Graph, Split System
Source:	Lecture Notes in Computer Science
Series Name:	Lecture Notes in Computer Science
Title of Book:	Algorithms in Bioinformatics. WABI 2008.
ISSN:	0302-9743
ISBN:	978-354087360-0
Publisher:	Springer
Volume:	5251
Page Range:	284-295
Date:	2008
Official Publication:	https://doi.org/10.1007/978-3-540-87361-7_24

Repository Staff Only: item control page