Fast neighbor joining

DOI10.1016/j.tcs.2008.12.040zbMath1161.92041OpenAlexW2035831318MaRDI QIDQ1019174

Jens Lagergren, Isaac Elias

Publication date: 28 May 2009

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2008.12.040

zbMATH Keywords

phylogenyneighbor joiningfast neighbor joiningnearly additivepairwise string distance

Mathematics Subject Classification ID

Problems related to evolution (92D15) Complexity and performance of numerical algorithms (65Y20)

Uses Software

• Seq-Gen
• r8s

Cites Work

• Unnamed Item
• Unnamed Item
• Matrix multiplication via arithmetic progressions
• Why neighbor-joining works
• The performance of neighbor-joining methods of phylogenetic reconstruction
• Combining polynomial running time and fast convergence for the disk-covering method.
• On the Approximability of Numerical Taxonomy (Fitting Distances by Tree Metrics)
• A few logs suffice to build (almost) all trees (I)
• Automata, Languages and Programming

This page was built for publication: Fast neighbor joining