Abstract
We analyze the performance of the popular class of neighbor-joining methods of phylogeny reconstruction. In particular, we find conditions under which these methods will determine the correct tree topology and show that these perform as well as possible in a certain sense. We also give indications of the performance of these methods when the conditions necessary to show that they determine the entire tree topology correctly, do not hold. We use these results to demonstrate an upper bound on the amount of data necessary to reconstruct the topology with high confidence.
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 callDisclaimer: 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.
