Neighbor joining with phylogenetic diversity estimates

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

The Neighbor-Joining algorithm is a recursive procedure for reconstructing trees that is based on a transformation of pairwise distances between leaves. We present a generalization of the neighbor-joining transformation, which uses estimates of phylogenetic diversity rather than pairwise distances in the tree. This leads to an improved neighbor-joining algorithm whose total running time is still polynomial in the number of taxa. On simulated data, the method outperforms other distance-based methods. We have implemented neighbor-joining for subtree weights in a program called MJOIN which is freely available under the Gnu Public License at http://bio.math.berkeley.edu/mjoin/ .

Keywords

Quantitative Methods, Combinatorics

Citation

URI

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

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/q-bio/0508001
 http://arxiv.org/abs/q-bio/0508001

Collections

arXiv