The distance-sum approach creates a summary distance matrix and runs neighbor joining on the summary matrix. The summary distance is simply the average distance of each pair in the set of m double anchored matrices. Note that some of the m double anchored matrices might not have a value for a given pair of leaves; we treat those as missing values and ignore them when averaging values. The presence of missing values jeopardizes our proofs of statistical consistency.