Why neighbor-joining works

DOI10.1007/s00453-007-9116-4zbMath1187.68683OpenAlexW2165256603WikidataQ56228813 ScholiaQ56228813MaRDI QIDQ1024210

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/

zbMATH Keywords

quartetsneighbor-joiningdistance methodsedge radius

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10)

Related Items (8)

DISTANCE-BASED PHYLOGENETIC ALGORITHMS: NEW INSIGHTS AND APPLICATIONS ⋮ A `stochastic safety radius' for distance-based tree reconstruction ⋮ \( F_{S T}\) and the triangle inequality for biallelic markers ⋮ Designing weights for quartet-based methods when data are heterogeneous across lineages ⋮ Expanding the class of global objective functions for dissimilarity-based hierarchical clustering ⋮ The neighbor-net algorithm ⋮ Fast neighbor joining ⋮ Spectral Neighbor Joining for Reconstruction of Latent Tree Models

Uses Software

• fastDNAml
• PHYLIP
• BIONJ
• Seq-Gen

Cites Work

• Unnamed Item
• Unnamed Item
• On the uniqueness of the selection criterion in neighbor-joining
• 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
• The performance of neighbor-joining methods of phylogenetic reconstruction
• A few logs suffice to build (almost) all trees (I)
• Performance study of phylogenetic methods: (unweighted) quartet methods and neighbor-joining
• Automata, Languages and Programming

This page was built for publication: Why neighbor-joining works