Why neighbor-joining works
From MaRDI portal
Publication:1024210
Recommendations
Cites work
- scientific article; zbMATH DE number 1865935 (Why is no real title available?)
- A few logs suffice to build (almost) all trees (I)
- A lower bound on the edge \(l_{\infty }\) radius of Saitou and Nei's method for phylogenetic reconstruction
- Automata, Languages and Programming
- On the edge \(l_{\infty }\) radius of Saitou and Nei's method for phylogenetic reconstruction
- On the uniqueness of the selection criterion in neighbor-joining
- Performance study of phylogenetic methods: (unweighted) quartet methods and neighbor-joining
- The minimum evolution distance-based approach to phylogenetic inference
- The performance of neighbor-joining methods of phylogenetic reconstruction
Cited in
(12)- \( F_{S T}\) and the triangle inequality for biallelic markers
- The neighbor-net algorithm
- The Geometry of the Neighbor-Joining Algorithm for Small Trees
- Spectral neighbor joining for reconstruction of latent tree models
- DISTANCE-BASED PHYLOGENETIC ALGORITHMS: NEW INSIGHTS AND APPLICATIONS
- On the edge \(l_{\infty }\) radius of Saitou and Nei's method for phylogenetic reconstruction
- A lower bound on the edge \(l_{\infty }\) radius of Saitou and Nei's method for phylogenetic reconstruction
- Designing weights for quartet-based methods when data are heterogeneous across lineages
- On the uniqueness of the selection criterion in neighbor-joining
- A `stochastic safety radius' for distance-based tree reconstruction
- Fast neighbor joining
- Expanding the class of global objective functions for dissimilarity-based hierarchical clustering
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)
