Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Journal of computational biology : a journal of computational molecular cell biology
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
