Drawing Rooted Phylogenetic Networks

The evolutionary history of a collection of species is usually represented by a phylogenetic tree. Sometimes, phylogenetic networks are used as a means of representing reticulate evolution or of showing uncertainty and incompatibilities in evolutionary datasets. This is often done using unrooted phylogenetic networks such as split networks, due in part, to the availability of software (SplitsTree) for their computation and visualization. In this paper we discuss the problem of drawing rooted phylogenetic networks as cladograms or phylograms in a number of different views that are commonly used for rooted trees. Implementations of the algorithms are available in new releases of the Dendroscope and SplitsTree programs.

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

[2]  Daniel H. Huson,et al.  Dendroscope: An interactive viewer for large phylogenetic trees , 2007, BMC Bioinformatics.

[3]  Simone Linz,et al.  A Reduction Algorithm for Computing The Hybridization Number of Two Trees , 2007, Evolutionary bioinformatics online.

[4]  Eric Bapteste,et al.  INAUGURAL ARTICLE by a Recently Elected Academy Member:Pattern pluralism and the Tree of Life hypothesis , 2007 .

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

[6]  D. Huson,et al.  Improved Layout of Phylogenetic Networks , 2008, IEEE/ACM Transactions on Computational Biology and Bioinformatics.

[7]  Yun S. Song,et al.  A Decomposition Theory for Phylogenetic Networks and Incompatible Characters , 2007, J. Comput. Biol..

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

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

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

[11]  Mitsuhiko Toda,et al.  Methods for Visual Understanding of Hierarchical System Structures , 1981, IEEE Transactions on Systems, Man, and Cybernetics.

[12]  Daniel H. Huson,et al.  Summarizing Multiple Gene Trees Using Cluster Networks , 2008, WABI.

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

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

[15]  Joel E. Cohen,et al.  Mathematics Is Biology's Next Microscope, Only Better; Biology Is Mathematics' Next Physics, Only Better , 2004, PLoS biology.

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

[17]  M. Bordewich,et al.  Computing the Hybridization Number of Two Phylogenetic Trees Is Fixed-Parameter Tractable , 2007, IEEE/ACM Transactions on Computational Biology and Bioinformatics.

[18]  T. Tuller,et al.  Inferring phylogenetic networks by the maximum parsimony criterion: a case study. , 2006, Molecular biology and evolution.

[19]  Jim Leebens-Mack,et al.  Identifying the basal angiosperm node in chloroplast genome phylogenies: sampling one's way out of the Felsenstein zone. , 2005, Molecular biology and evolution.

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

[21]  Daniel H. Huson,et al.  Constructing splits graphs , 2004, IEEE/ACM Transactions on Computational Biology and Bioinformatics.

[22]  Daniel H Huson,et al.  Drawing explicit phylogenetic networks and their integration into SplitsTree , 2008, BMC Evolutionary Biology.

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