Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published March 7, 2017 | Submitted
Report Open

Neighbor joining with phylogenetic diversity estimates

Abstract

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/

Additional Information

This work was partially funded by an NIH grant (R01HG2362). L.P. was also supported by a Sloan foundation fellowship. D.L. was also supported by NIH grant (GM68423).

Attached Files

Submitted - 0508001.pdf

Files

0508001.pdf
Files (224.8 kB)
Name Size Download all
md5:c39108af4c92ed85c461c819960470ad
224.8 kB Preview Download

Additional details

Created:
August 19, 2023
Modified:
October 24, 2023