Skip to main content
. 2010 Jan 5;11:7. doi: 10.1186/1471-2105-11-7

Figure 4.

Figure 4

Comparison to other tree editors. I: Import, IE: Im- and export. 1All programs tested with balanced binary trees in Newick format. The value listed is the number of terminals of the largest tree that could still be opened in less than two minutes on an average desktop computer (2.2 GHz AMD Athlon™ XP processor, 1 GB RAM). 2Numerical and textual annotations of nodes and branches can be calculated by any user defined mathematical expression from the values of other annotations in the tree. 3Any tree element can be copied to any position in the same or another tree (Programs that can only copy whole trees or paste subtrees to a new file are not checked in this column.). 4User defined text replacement in node names and all annotations. 5Numerical values of annotations define formatting of tree elements (e.g. color, width, text height). 6Documentation going beyond the original publication and explaining the different options. 7Only the last edit can be undone. (In contrast, TreeGraph 2 stores a whole undo history which can be undone (and redone) to any point.). 8Positioning options for the labels are not offered. 9Only one direction (not up and down). 10TreeDyn allows labeling a group of nodes with a legend (not automatically positioned), but the label gets lost during edit operations like ladderizing. 11Specific formats for subtrees are possible. Branches and nodes cannot be formatted independently. 12Only very brief descriptions.