Given n species with a distance matrix D_ij, find a binary tree (with lengths associated to each branch) so that all the species are represented and the sum of the squares of the distance errors is minimized.