Why neighbor-joining works
From MaRDI portal
Publication:1024210
DOI10.1007/S00453-007-9116-4zbMATH Open1187.68683OpenAlexW2165256603WikidataQ56228813 ScholiaQ56228813MaRDI QIDQ1024210FDOQ1024210
Lior Pachter, Dan Levy, Radu Mihaescu
Publication date: 16 June 2009
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://authors.library.caltech.edu/74834/
Recommendations
Cites Work
- Title not available (Why is that?)
- Performance study of phylogenetic methods: (unweighted) quartet methods and neighbor-joining
- On the uniqueness of the selection criterion in neighbor-joining
- The performance of neighbor-joining methods of phylogenetic reconstruction
- A few logs suffice to build (almost) all trees (I)
- Title not available (Why is that?)
- Automata, Languages and Programming
- A lower bound on the edge \(l_{\infty }\) radius of Saitou and Nei's method for phylogenetic reconstruction
- On the edge \(l_{\infty }\) radius of Saitou and Nei's method for phylogenetic reconstruction
Cited In (8)
- Fast neighbor joining
- A `stochastic safety radius' for distance-based tree reconstruction
- Designing weights for quartet-based methods when data are heterogeneous across lineages
- The neighbor-net algorithm
- Expanding the class of global objective functions for dissimilarity-based hierarchical clustering
- Spectral Neighbor Joining for Reconstruction of Latent Tree Models
- \( F_{S T}\) and the triangle inequality for biallelic markers
- DISTANCE-BASED PHYLOGENETIC ALGORITHMS: NEW INSIGHTS AND APPLICATIONS
Uses Software
This page was built for publication: Why neighbor-joining works
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1024210)
