Why neighbor-joining works

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

We show that the neighbor-joining algorithm is a robust quartet method for constructing trees from distances. This leads to a new performance guarantee that contains Atteson's optimal radius bound as a special case and explains many cases where neighbor-joining is successful even when Atteson's criterion is not satisfied. We also provide a proof for Atteson's conjecture on the optimal edge radius of the neighbor-joining algorithm. The strong performance guarantees we provide also hold for the quadratic time fast neighbor-joining algorithm, thus providing a theoretical basis for inferring very large phylogenies with neighbor-joining.
Revision 2

Keywords

Data Structures and Algorithms, Discrete Mathematics, F.2.0

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/131786

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/cs/0602041
 http://arxiv.org/abs/cs/0602041

Collections

arXiv