Automata, Languages and Programming

DOI10.1007/11523468zbMATH Open1081.92030OpenAlexW2940595899MaRDI QIDQ5716751FDOQ5716751

Jens Lagergren, Isaac Elias

Publication date: 10 January 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11523468

Recommendations

• Fast neighbor joining
• scientific article; zbMATH DE number 2099988
• Simple and fast nearest neighbor search
• Fast neighbor search by using revised \(k\)-d tree

Mathematics Subject Classification ID

Problems related to evolution (92D15) Computational methods for problems pertaining to biology (92-08)

Cited In (7)

• Faster neighbour list generation using a novel lattice vector representation
• Fast neighbor joining
• The neighbor-net algorithm
• Why neighbor-joining works
• Performance study of phylogenetic methods: (unweighted) quartet methods and neighbor-joining
• The Performance of Phylogenetic Methods on Trees of Bounded Diameter
• Optimal implementations of UPGMA and other common clustering algorithms

This page was built for publication: Automata, Languages and Programming

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