Drawing explicit phylogenetic networks and their integration into SplitsTree

BackgroundSplitsTree provides a framework for the calculation of phylogenetic trees and networks. It contains a wide variety of methods for the import/export, calculation and visualization of phylogenetic information. The software is developed in Java and implements a command line tool as well as a graphical user interface.ResultsIn this article, we present solutions to two important problems in the field of phylogenetic networks. The first problem is the visualization of explicit phylogenetic networks. To solve this, we present a modified version of the equal angle algorithm that naturally integrates reticulations into the layout process and thus leads to an appealing visualization of these networks. The second problem is the availability of explicit phylogenetic network methods for the general user. To advance the usage of explicit phylogenetic networks by biologists further, we present an extension to the SplitsTree framework that integrates these networks. By addressing these two problems, SplitsTree is among the first programs that incorporates implicit and explicit network methods together with standard phylogenetic tree methods in a graphical user interface environment.ConclusionIn this article, we presented an extension of SplitsTree 4 that incorporates explicit phylogenetic networks. The extension provides a set of core classes to handle explicit phylogenetic networks and a visualization of these networks.

[1]  Bernard M. E. Moret,et al.  NetGen: generating phylogenetic networks with diploid hybrids , 2006, Bioinform..

[2]  Kaizhong Zhang,et al.  Perfect phylogenetic networks with recombination , 2001, J. Comput. Biol..

[3]  D. Huson,et al.  Application of phylogenetic networks in evolutionary studies. , 2006, Molecular biology and evolution.

[4]  Yun S. Song,et al.  Constructing Minimal Ancestral Recombination Graphs , 2005, J. Comput. Biol..

[5]  Daniel H. Huson,et al.  Computing recombination networks from binary sequences , 2005, ECCB/JBI.

[6]  Dan Gusfield,et al.  Efficient reconstruction of phylogenetic networks with constrained recombination , 2003, Computational Systems Bioinformatics. CSB2003. Proceedings of the 2003 IEEE Bioinformatics Conference. CSB2003.

[7]  David S. Johnson,et al.  Crossing Number is NP-Complete , 1983 .

[8]  Yun S. Song,et al.  Minimum Recombination Histories by Branch and Bound , 2005, WABI.

[9]  Dan Gusfield,et al.  A Fundamental Decomposition Theory for Phylogenetic Networks and Incompatible Characters , 2005, RECOMB.

[10]  B. Pryor,et al.  Molecular characterization of Embellisia and Nimbya species and their relationship to Alternaria, Ulocladium and Stemphylium. , 2003, Mycologia.

[11]  Yun S. Song,et al.  Parsimonious Reconstruction of Sequence Evolution and Haplotype Blocks , 2003, WABI.

[12]  A. Dress,et al.  A canonical decomposition theory for metrics on a finite set , 1992 .

[13]  David S. Johnson,et al.  Some Simplified NP-Complete Graph Problems , 1976, Theor. Comput. Sci..

[14]  Dan Gusfield,et al.  The Fine Structure of Galls in Phylogenetic Networks , 2004, INFORMS J. Comput..

[15]  Tandy J. Warnow,et al.  Reconstructing reticulate evolution in species: theory and practice , 2004, RECOMB.

[16]  Loren H Rieseberg,et al.  Reconstructing patterns of reticulate evolution in plants. , 2004, American journal of botany.

[17]  J. Hein.  Reconstructing evolution of sequences subject to recombination using parsimony. , 1990, Mathematical biosciences.

[18]  Daniel H. Huson,et al.  Reconstruction of Reticulate Networks from Gene Trees , 2005, RECOMB.

[19]  Daniel H. Huson,et al.  Beyond Galled Trees - Decomposition and Computation of Galled Networks , 2007, RECOMB.

[20]  R. Hudson.  Properties of a neutral allele model with intragenic recombination. , 1983, Theoretical population biology.

[21]  T. Sang,et al.  Testing hybridization hypotheses based on incongruent gene trees. , 2000, Systematic biology.

[22]  D. Maddison,et al.  NEXUS: an extensible file format for systematic information. , 1997, Systematic biology.

[23]  Michael T. Hallett,et al.  Simultaneous identification of duplications and lateral transfers , 2004, RECOMB.

[24]  Charles Semple,et al.  Computing the minimum number of hybridization events for a consistent evolutionary history , 2007, Discret. Appl. Math..

[25]  P. Marjoram,et al.  Ancestral Inference from Samples of DNA Sequences with Recombination , 1996, J. Comput. Biol..

[26]  Yun S. Song,et al.  On the minimum number of recombination events in the evolutionary history of DNA sequences , 2004, Journal of mathematical biology.