Sciweavers

4 search results - page 1 / 1
» Minimum-Area h-v Drawings of Complete Binary Trees
Sort
View
GD
1997
Springer
14 years 1 months ago
Minimum-Area h-v Drawings of Complete Binary Trees
Pierluigi Crescenzi, Paolo Penna
IPL
2002
90views more  IPL 2002»
13 years 9 months ago
On the approximability of two tree drawing conventions
We consider two aesthetic criteria for the visualization of rooted trees: inclusion and tip-over. Finding the minimum area layout according to either of these two standards is an ...
Paolo Penna
ALENEX
2009
106views Algorithms» more  ALENEX 2009»
13 years 11 months ago
Drawing Binary Tanglegrams: An Experimental Evaluation
A tanglegram is a pair of trees whose leaf sets are in oneto-one correspondence; matching leaves are connected by inter-tree edges. In applications such as phylogenetics or hierar...
Martin Nöllenburg, Markus Völker, Alexan...
BMCBI
2010
143views more  BMCBI 2010»
13 years 10 months ago
ETE: a python Environment for Tree Exploration
Background: Many bioinformatics analyses, ranging from gene clustering to phylogenetics, produce hierarchical trees as their main result. These are used to represent the relations...
Jaime Huerta-Cepas, Joaquín Dopazo, Toni Ga...