Drawing phylogenetic trees

Authors:
Christian Bachmaier;Ulrik Brandes;Barbara Schlieper
Affiliations:
Department of Computer & Information Science, University of Konstanz, Germany;Department of Computer & Information Science, University of Konstanz, Germany;Department of Computer & Information Science, University of Konstanz, Germany
Venue:
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Year:
2005

Citing 5
Cited 2

A node-positioning algorithm for general trees

Software—Practice & Experience
Fixed edge-length graph drawing is NP-hard

Discrete Applied Mathematics
Graph Drawing: Algorithms for the Visualization of Graphs

Graph Drawing: Algorithms for the Visualization of Graphs
Phylogenetic trees: an information visualisation perspective

APBC '04 Proceedings of the second conference on Asia-Pacific bioinformatics - Volume 29
Tidier Drawings of Trees

IEEE Transactions on Software Engineering

On the Hardness of Orthogonal-Order Preserving Graph Drawing

Graph Drawing
Angle and distance constraints on tree drawings

GD'06 Proceedings of the 14th international conference on Graph drawing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present linear-time algorithms for drawing phylogenetic trees in radial and circular representations. In radial drawings given edge lengths (representing evolutionary distances) are preserved, but labels (names of taxons represented in the leaves) need to be adjusted, whereas in circular drawings labels are perfectly spread out, but edge lengths adjusted. Our algorithms produce drawings that are unique solutions to reasonable criteria and assign to each subtree a wedge of its own. The linear running time is particularly interesting in the circular case, because our approach is a special case of Tutte's barycentric layout algorithm involving the solution of a system of linear equations.