On Properties of Additive Tree Algorithms

There is a growing interest in methods used for analyzing dissimilarity measurements which occur in many fields of biology, medicine, psychology etc. These data may be analyzed by using some graph theoretical structures. We concentrate on a special graph: the additive tree. Different methods have been proposed for constructing additive trees for given dissimilarity data, but there is less knowledge concerning properties of these methods. We present some suggestions for analyzing properties of additive tree constructing methods which allow a preliminary rating of proposed methods.