Fast neighbor joining

DOI10.1016/J.TCS.2008.12.040MaRDI QIDQ1019174zbMATH OpenOpenAlexFDO

Authors Isaac Elias, Jens Lagergren

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

fast neighbor joiningnearly additiveneighbor joiningpairwise string distancephylogeny

Mathematics Subject Classification ID

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

Recommendations

• Automata, Languages and Programming
• scientific article; zbMATH DE number 1945176
• Optimality of the neighbor joining algorithm and faces of the balanced minimum evolution polytope
• scientific article; zbMATH DE number 1088265
• Why neighbor-joining works

Cites work

• A few logs suffice to build (almost) all trees (I)
• Automata, Languages and Programming
• Combining polynomial running time and fast convergence for the disk-covering method.
• scientific article; zbMATH DE number 1113975 (Why is no real title available?)
• scientific article; zbMATH DE number 1945176 (Why is no real title available?)
• Matrix multiplication via arithmetic progressions
• On the Approximability of Numerical Taxonomy (Fitting Distances by Tree Metrics)
• The performance of neighbor-joining methods of phylogenetic reconstruction
• Why neighbor-joining works

Cited in

(7)

• Why neighbor-joining works
• An improved neighbor-joining method and its applications
• scientific article; zbMATH DE number 1088265 (Why is no real title available?)
• scientific article; zbMATH DE number 1113975 (Why is no real title available?)
• Automata, Languages and Programming
• Faster neighbour list generation using a novel lattice vector representation
• On the uniqueness of the selection criterion in neighbor-joining

Describes a project that uses

Uses Software

• Seq-Gen
• r8s

This page was built for publication: Fast neighbor joining

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1019174)