Definitions for

**"Neighbor-joining"**Method for deriving a tree from distances (see distance matrix). Compares number of differences in a conserved region, pairing those that are the most alike and using that pair to join to next closest sequence. Advantage for this method is it is very fast to compute, however it is not a very effective method for comparing sequences that have diverged significantly.

This is an algorithm for inferring a branching tree diagram from a distance matrix. It works by successively clustering pairs of taxa together. It is related to the UPGMA method of inferring a branching diagram from a distance matrix. Unlike the UPGMA method, NJ can facilitate contemporary tips of uneven length. This makes it a more appropriate tree reconstruction method than UPGMA in thos instances when evolution has not proceeded in a strictly clock-like fashion.

An algorithm for constructing phylogenetic trees using distance data.