Constructing Phylogenetic Supernetworks from Quartets
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.
Unable to display preview. Download preview PDF.
- 1.Bryant, D.: A classification of consensus methods for phylogenies. In: Janowitz, M., Lapointe, F.J., McMorris, F., Mirkin, B., Roberts, F. (eds.) BioConsensus. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 61, pp. 163–184. American Mathematical Society (2003)Google Scholar
- 6.Holland, B., Moulton, V.: Consensus networks: A method for visualising incompatibilities in collections of trees. In: Benson, G., Page, R.D.M. (eds.) WABI 2003. LNCS (LNBI), vol. 2812, pp. 165–176. Springer, Heidelberg (2003)Google Scholar
- 10.Grünewald, S., Moulton, V., Spillner, A.: Consistency of the QNet algorithm for generating planar split graphs from weighted quartets. Discrete Applied Mathematics (in press, 2007)Google Scholar