Neighbor joining with phylogenetic diversity estimates
| dc.creator | Levy, Dan | |
| dc.creator | Yoshida, Ruriko | |
| dc.creator | Pachter, Lior | |
| dc.date | 2005-07-30 | |
| dc.date.accessioned | 2026-07-07T05:59:23Z | |
| dc.date.available | 2026-07-07T05:59:23Z | |
| dc.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/ . | |
| dc.identifier | https://arxiv.org/abs/q-bio/0508001 | |
| dc.identifier | http://arxiv.org/abs/q-bio/0508001 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/88663 | |
| dc.subject | Quantitative Methods | |
| dc.subject | Combinatorics | |
| dc.title | Neighbor joining with phylogenetic diversity estimates | |
| dc.type | text |