Algorithms for visualizing phylogenetic networks

Abstract We study the problem of visualizing phylogenetic networks, which are extensions of the Tree of Life in biology. We use a space filling visualization method, called DAGmaps, in order to obtain clear visualizations using limited space. In this paper, we first show that the general problem of drawing galled networks as DAGmaps is NP-complete. Next, we restrict our attention to galled trees and planar galled networks and present linear time algorithms for visualizing them as DAGmaps. Finally, we explore whether these graphs can be visualized using One-Dimensional DAGmaps.

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

[2]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[3]  Dan Gusfield,et al.  Optimal, efficient reconstruction of root-unknown phylogenetic networks with constrained and structured recombination , 2005, J. Comput. Syst. Sci..

[4]  Simon M. Lin,et al.  Applications of Tree-Maps to hierarchical biological data , 2002, Bioinform..

[5]  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.

[6]  D. Huson,et al.  A Survey of Combinatorial Methods for Phylogenetic Networks , 2010, Genome biology and evolution.

[7]  Daniel H. Huson,et al.  Computing galled networks from real data , 2009, Bioinform..

[8]  Doolittle Wf.  Phylogenetic Classification and the Universal Tree , 1999 .

[9]  Ioannis G. Tollis,et al.  Visualization of Functional Aspects of microRNA Regulatory Networks Using the Gene Ontology , 2006, ISBMDA.

[10]  Ioannis G. Tollis,et al.  DAGmaps and ε-Visibility Representations for DAGs: Algorithms and Characterizations , 2012, J. Graph Algorithms Appl..

[11]  Ben Shneiderman,et al.  Tree-maps: a space-filling approach to the visualization of hierarchical information structures , 1991, Proceeding Visualization '91.

[12]  Maurizio Patrignani,et al.  Visualizing Co-Phylogenetic Reconciliations , 2017, Graph Drawing.

[13]  Andrzej Lingas,et al.  Computing the Rooted Triplet Distance between Galled Trees by Counting Triangles , 2012, CPM.

[14]  C. Kuratowski.  Sur le problème des courbes gauches en Topologie , 1930 .

[15]  Ge Xia,et al.  Seeing the trees and their branches in the network is hard , 2007, Theor. Comput. Sci..

[16]  Ben Shneiderman,et al.  Visualization and analysis of microarray and gene ontology data with treemaps , 2004, BMC Bioinformatics.

[17]  Ioannis G. Tollis,et al.  Using Treemaps to Visualize Phylogenetic Trees , 2005, ISBMDA.

[18]  Wing-Kin Sung,et al.  Algorithms for Combining Rooted Triplets into a Galled Phylogenetic Network , 2006, SIAM J. Comput..

[19]  Carol Friedman,et al.  Information Visualization Techniques in Bioinformatics during the Postgenomic Era. , 2004, Drug discovery today. Biosilico.

[20]  Daniel H. Huson,et al.  Phylogenetic Networks - Concepts, Algorithms and Applications , 2011 .

[21]  Carlo Mannino,et al.  Optimal Upward Planarity Testing of Single-Source Digraphs , 1998, SIAM J. Comput..

[22]  M T Clegg,et al.  Heterogeneous geographic patterns of nucleotide sequence diversity between two alcohol dehydrogenase genes in wild barley (Hordeum vulgare subspecies spontaneum). , 2001, Proceedings of the National Academy of Sciences of the United States of America.

[23]  Kaizhong Zhang,et al.  Perfect Phylogenetic Networks with Recombination , 2001, J. Comput. Biol..

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

[25]  Ioannis G. Tollis,et al.  Journal of Graph Algorithms and Applications Dagmaps: Space Filling Visualization of Directed Acyclic Graphs , 2022 .

[26]  Daniel H. Huson,et al.  Phylogenetic Networks: Introduction to phylogenetic networks , 2010 .