Neighbor-Joining Methods Start with star-like tree. Find neighbors sequentially to minimize total length of all branches C B C D Studier& Kepler 1988 Q12=(N-2)d12-d1-d2 Where any 2 sequences can be 1 and 2 Try all possible sequence combinations. Whichever combination of pairs gives the smallest Q1 is the final treeNeighbor-Joining Methods Start with star-like tree. Find neighbors sequentially to minimize total length of all branches A B D C D Studier & Kepler 1988: Q12=(N-2)d12 - Σ d1i - Σ d2i Where any 2 sequences can be 1 and 2 Try all possible sequence combinations. Whichever combination of pairs gives the smallest Q12 is the final tree! B A C