Constructing additive trees when the error is small.

We consider the problem of constructing an additive tree from a given matrix of pairwise distances, when observation errors are allowed. We give conditions under which the tree topology is unique and semi-unique. We also design an efficient algorithm to construct a tree when the error is relatively small.