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.
Wang
L
L
Department of Computer Science, City University of Hong Kong, Kowloon, Hong Kong.
Gusfield
D
D
D000465:Algorithms; D019143:Evolution, Molecular; D008969:Molecular Sequence Data