Neighbor joining is a bottom-up, agglomerative clustering method used in bioinformatics to build phylogenetic trees. It was created by Naruya Saitou and Masatoshi Nei in 1987 and is usually applied to DNA or protein sequence data, requiring knowledge of the distance between every pair of taxa in order to assemble the tree. This description is adapted from Wikipedia contributors under CC BY-SA 4.0; changes were made. https://creativecommons.org/licenses/by-sa/4.0/
Facts
Classification
Design Technique Design TechniqueHeuristic or Approximation 1 Time Complexity
Time Complexity (category) Connections
In Field
Source Wikipedia: Neighbor joining
Uses Design Technique
Sources
1. Wikipedia: Neighbor joining
- Neighbor joining: "may be viewed as a greedy heuristic for the balanced minimum evolution criterion"
- Neighbor joining: same sentence, "greedy heuristic"
In Field: Bioinformatics, Lead sentence
neighbor joining is a bottom-up (agglomerative) clustering method for the creation of phylogenetic trees, created by Naruya Saitou and Masatoshi Nei in 1987. Usually based on DNA or protein sequence data, the algorithm requires knowledge of the distance betwee
In Group: Phylogenetic Tree Algorithms and Measures, Lead
In bioinformatics, neighbor joining is a bottom-up (agglomerative) clustering method for the creation of phylogenetic trees, created by Naruya Saitou and Masatoshi Nei in 1987.
View the SourceReader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.