This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Improved Layout of Phylogenetic Networks
July-September 2008 (vol. 5 no. 3)
pp. 472-479
Split networks are increasingly being used in phylogenetic analysis. Usually, a simple equal angle algorithm is used to draw such networks, producing layouts that leave much room for improvement. Addressing the problem of producing better layouts of split networks, this paper presents an algorithm for maximizing the area covered by the network, describes an extension of the equal-daylight algorithm to networks, looks into using a spring embedder and discusses how to construct rooted split networks.

[1] H.-J. Bandelt and A.W.M. Dress, “A Canonical Decomposition Theory for Metrics on a Finite Set,” Advances in Math., vol. 92, pp.47-105, 1992.
[2] H.-J. Bandelt, P. Forster, B.C. Sykes, and M.B. Richards, “Mitochondrial Portraits of Human Population Using Median Networks,” Genetics, vol. 141, pp. 743-753, 1995.
[3] G. Di Battista, P. Eades, R. Tamassia, and I. Tollis, “Algorithms for Drawing Graphs: An Annotated Bibliography,” Computational Geometry: Theory and Applications, vol. 4, no. 5, pp. 235-282, 1994.
[4] J. Diaz, J. Petit, and M. Serna, “A Survey of Graph Layout Problems,” ACM Computing Surveys, vol. 34, no. 3, pp. 313-356, 2002.
[5] A.W.M. Dress and D.H. Huson, “Constructing Splits Graphs,” IEEE/ACM Trans. Computational Biology and Bioinformatics, vol. 1, no. 3, pp. 109-115, July-Sept. 2004.
[6] J. Felsenstein, Inferring Phylogenies. Sinauer Assoc., 2004.
[7] T. Fruchterman and E. Reingold, “Graph Drawing by Force-Directed Placement,” Software—Practice and Experience, vol. 21, no. 11, pp. 1129-1164, 1991.
[8] K.T. Huber, M. Langton, D. Penny, V. Moulton, and M. Hendy, “Spectronet: A Package for Computing Spectra and Median Networks,” Applied Bioinformatics, vol. 1, pp. 159-161, 2002.
[9] D.H. Huson, “SplitsTree: A Program for Analyzing and Visualizing Evolutionary Data,” Bioinformatics, vol. 14, no. 10, pp. 68-73, 1998.
[10] D.H. Huson and D. Bryant, “Application of Phylogenetic Networks in Evolutionary Studies,” Molecular Biology and Evolution, vol. 23, no. 2, pp. 254-267, , 2006.
[11] D.H. Huson, T. Dezulian, T. Kloepper, and M.A. Steel, “Phylogenetic Super-Networks from Partial Trees,” IEEE/ACM Trans. Computational Biology and Bioinformatics, vol. 1, no. 4, pp. 151-158, Oct.-Dec. 2004.
[12] D.H. Huson, T. Kloepper, P.J. Lockhart, and M.A. Steel, “Reconstruction of Reticulate Networks from Gene Trees,” Proc. Ninth Int'l Conf. Research in Computational Molecular Biology (RECOMB '05), 2005.
[13] D.H. Huson and T.H. Kloepper, “Computing Recombination Networks from Binary Sequences,” Proc. European Conf. Computational Biology (ECCB '05), 2005.
[14] B.M. Pryor and D.M. Bigelow, “Molecular Characterization of Embellisia and Nimbya Species and Their Relationship to Alternaria, Ulocladium and Stemphylium,” Mycologia, vol. 95, no. 6, pp. 1141-1154, 2003.
[15] B.M. Pryor and R.L. Gilbertson, “Phylogenetic Relationships among Alternaria and Related Fungi Based upon Analysis of Nuclear Internal Transcribed Sequences and Mitochondrial Small Subunit Ribosomal DNA Sequences,” Mycological Research, vol. 104, no. 11, pp. 1312-1321, 2000.
[16] C. Semple and M.A. Steel, Phylogenetics. Oxford Univ. Press, 2003.

Index Terms:
phylogenetics, phylogenetic networks, graph drawing, algorithms
Citation:
Philippe Gambette, Daniel H. Huson, "Improved Layout of Phylogenetic Networks," IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol. 5, no. 3, pp. 472-479, July-Sept. 2008, doi:10.1109/tcbb.2007.1046
Usage of this product signifies your acceptance of the Terms of Use.