One way would be to label the root to make it a leaf, and apply NJ.
Neighbor-joining reconstructs the original branch lengths (and topology) given
tree-distances between the leaves.
Cécile
On Nov 30, 2016, at 10:30 AM, Juan Antonio Balbuena
> wrote:
Hola Juan.
If your heights (distances) above the root are a vector h in the order
of the node indices of the tree (in tree$edge) it would be as easy as:
tree$edge.length<-rep(NA,nrow(tree$edge))
for(i in 1:nrow(tree$edge))
tree$edge.length[i]<-h[tree$edge[i,2]]-h[tree$edge[i,1]]
If
Hi all
This is a simple question:
I have a set of ultrametric trees with information on their
topology but without branch lengths. On a separate file, I have
the distances of each node and leaf to the root. Can someone
instruct me on how to to compute the
Dear Florian,
What do you mean, exactly? Do you mean the K statistics is, say, about
0.5, and that the randomizaton test for phylogenetic signal (Blomberg et
al. 2003), which is based on the MSE not K, is significant, indicating that
you do have some degree of signal (more than zero)?
Cheers,