Thanks Klaus,
The problem was that I expected logically that two nodes would have the same
distance. For example with ((A,B),C), I expect d(A,C)==d(B,C).
I'm sure for most people's purposes it isn't a problem that they aren't exactly
equal, but if you apply functions involving the ranks of the
I have found that ".compressTipLabel" can take quite a while for larger tree
distributions. By vectorizing the for loop, I've got substantial speed
improvements. For really big distributions, multithreading definitely helps
(but does come with a memory cost).
Code is below. HTH.
Joseph.
# rea