perl?

[semna]

Hi
I want to make a newick format and then make a tree. I already have taxonomy ID of leaf nodes. If we assume that the tree is like A,B),C or A,(B,C) . How can check if the common node for A and B is closer than the first common node for A and C or B and C?
I am just looking for psudocode in perl. Thanks in advance.

[krobison]

1) Build the tree in memory

$node={'id'=>$myId, 'parent'=>$myParent, 'children'=>[$myLeft,$myRight]}

Nodes are stored in a hash by 'id'; $myParent, $myLeft, $myRight will either be direct references to the appropriate nodes or the ids of those nodes.

2) From each node of interest, ascend the tree to identify the distance to any other node of interest. It might be desirable to simply build a distance matrix in another hash (or another field in the node structure)

3)