Automata, Languages and Programming

DOI10.1007/11523468MaRDI QIDQ5716751zbMATH OpenOpenAlexFDO

Authors Isaac Elias, Jens Lagergren

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

Mathematics Subject Classification ID

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

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

Cited in

(10)

• Optimal implementations of UPGMA and other common clustering algorithms
• Faster neighbour list generation using a novel lattice vector representation
• Spectral neighbor joining for reconstruction of latent tree models
• Fast neighbor joining
• The neighbor-net algorithm
• An improved neighbor-joining method and its applications
• Why neighbor-joining works
• Performance study of phylogenetic methods: (unweighted) quartet methods and neighbor-joining
• The Geometry of the Neighbor-Joining Algorithm for Small Trees
• The Performance of Phylogenetic Methods on Trees of Bounded Diameter

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)