Neighbor joining

Known as: NJ (disambiguation), Neighbor-joining, Neighbour joining 
In bioinformatics, neighbor joining is a bottom-up (agglomerative) clustering method for the creation of phylogenetic trees, created by Naruya Saitou… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1989-2017
020406019892017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2009
2009
Neighbor-joining is a well-established hierarchical clustering algorithm for inferring phylogenies. It begins with observed… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2007
2007
We show that the neighbor-joining algorithm is a robust quartet method for constructing trees from distances. This leads to a new… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2006
Highly Cited
2006
SUMMARY Clearcut is an open source implementation for the relaxed neighbor joining (RNJ) algorithm. While traditional neighbor… (More)
  • figure 1
  • figure 2
Is this relevant?
2005
2005
The neighbor-joining method by Saitou and Nei is a widely used method for constructing phylogenetic trees. The formulation of the… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2005
2005
Reconstructing the evolutionary history of a set of species is a fundamental problem in biology and methods for solving this… (More)
Is this relevant?
2005
2005
The Neighbor-Joining algorithm is a recursive procedure for reconstructing trees that is based on a transformation of pairwise… (More)
  • table 1
Is this relevant?
Highly Cited
2002
Highly Cited
2002
We have written a fast implementation of the popular Neighbor-Joining tree building algorithm. QuickTree allows the… (More)
  • figure 1
Is this relevant?
Highly Cited
1999
Highly Cited
1999
We analyze the performance of the popular class of neighbor-joining methods of phylogeny reconstruction. In particular, we find… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • table 2
Is this relevant?
Highly Cited
1998
Highly Cited
1998
The relative efficiencies of several tree-making methods for obtaining the correct phylogenetic tree were studied by using… (More)
  • figure 1
  • table 1
  • table 2
  • table 3
  • table 4
Is this relevant?
Highly Cited
1997
Highly Cited
1997
Because they are designed to produced just one tree, neighbor-joining programs can obscure ambiguities in data. Ambiguities can… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?