Graph drawing by force-directed placement
Software—Practice & Experience
Algorithms for drawing graphs: an annotated bibliography
Computational Geometry: Theory and Applications
A survey of graph layout problems
ACM Computing Surveys (CSUR)
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Phylogenetic Super-Networks from Partial Trees
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Computing recombination networks from binary sequences
Bioinformatics
Reconstruction of reticulate networks from gene trees
RECOMB'05 Proceedings of the 9th Annual international conference on Research in Computational Molecular Biology
Drawing Rooted Phylogenetic Networks
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Visual Exploration across Biomedical Databases
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Constructing and Drawing Regular Planar Split Networks
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
| Hi-index | 0.00 |
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.