Neighbor joining with phylogenetic diversity estimates
Dan Levy, Ruriko Yoshida, Lior Pachter
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/ .
Create a lesson
Related papers
RetroTAC: Learning Route-Derived Synthetic Accessibility for PROTACs
Stefano Ribes, Jia Xin, Zhu Zhu et al.
Elucidating the Space of Enzymatic Reaction: A Unified Benchmark and Pretrained Model
Yutong Hu, Tianming Huang, Yanbo Zhao et al.
Cross-species representation learning aligns mouse and human neural dynamics and tracks clinical drug efficacy
Marko Tvrdic, Justin Richmond Domingo, Jae Ann Buenaluz et al.
Toward Reliable Patient-Specific Aortic Strain Mapping from 4D CTA: Validation, Spectral Structure, and Clinical Potential
Tricia Lobo, Wensi Wu, Harold I. Litt et al.
CircuitATLAS: Agentic reasoning over a systems neuroscience knowledge graph for target discovery in circuitopathies
Gabriel Ocana-Santero, Marko Tvrdic
FaceKit: a Toolkit for Interpretable Facial Phenotyping, Synthetic Image Generation and Privacy Analysis in Rare Diseases
Hongzhuo Chen, Zhanliang Wang, Florent Pollet et al.