Neighbor Joining Algorithm

1
Neighbor Joining Algorithm
L T set of leaf nodes While L gt 2 Find
i,j in L such that Dij is minimal Add new node k
to T Let dik 1/2(dijri-rj) djk dij -
dik Let dkm 1/2(dimdjm-dij) for all other m
in L Remove i and j from L Let Dkm dkm -
(rkrm) for all m in L Add k to L Join
remaining two nodes in L