| Calling Sequence
| Tree(Left,Height,Right,xtra)
|
| Parameters
| | Name | Type | Description |
|
| Left
| {Leaf,Tree} | recursive left subtree |
| Right
| {Leaf,Tree} | recursive right subtree |
| Height
| anything | any information, usually height |
| xtra
| anything | (optional) additional information |
|
| Return Type
| Tree |
| Methods
| GetPartitions, Graph, GraphR, matrix, Newick, Rand, select, Signature |
| Synopsis
| The Tree data structure holds binary trees which
may or may not be labelled and/or weighted.
The Left and Right subtree of the tree are either
(1) a Tree structure or (2) a Leaf structure.
Many built-in Darwin routines for phylogenetic trees, assume
that the Height field refers to the height of the node.
These routines include DrawTree.
The use of the xtra field varies significantly
from algorithm to algorithm. |
| Examples
| > t := Tree(Tree(Leaf(A),5,Leaf(B)),0,Tree(Leaf(C),11,Leaf(D)));
t := Tree(Tree(Leaf(A),5,Leaf(B)),0,Tree(Leaf(C),11,Leaf(D)))
> t[Left];
Tree(Leaf(A),5,Leaf(B))
> t[Right];
Tree(Leaf(C),11,Leaf(D))
|
| See also
| BootstrapTree, ComputeDimensionlessFit, DrawTree, GapTree, Infix, Leaf, LeastSquaresTree, Leaves, PhylogeneticTree, Postfix, Prefix, RBFS_Tree, ReconcileTree, RobinsonFoulds, SignedSynteny, Synteny |