World Library  
Flag as Inappropriate
Email this Article

Neighbor joining

 

Neighbor joining

This genetic distance map made in 2002 is an estimate of 18 world human groups by a neighbour-joining method based on 23 kinds of genetic information. It was made by Saitou Naruya (斎藤成也) professor at the (Japanese) National Institute for Genetics.[1]

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.[2] Usually used for trees based on DNA or protein sequence data, the algorithm requires knowledge of the distance between each pair of taxa (e.g., species or sequences) to form the tree.[3]

Contents

  • The algorithm 1
    • The Q-matrix 1.1
    • Distance from the pair members to the new node 1.2
    • Distance of the other taxa from the new node 1.3
    • Complexity 1.4
  • Example 2
  • Neighbor joining as minimum evolution 3
  • Advantages and disadvantages 4
  • Implementations and variants 5
  • See also 6
  • References 7
  • External links 8

The algorithm

Starting with a star tree (A), the Q matrix is calculated and used to choose a pair of nodes for joining, in this case f and g. These are joined to a newly created node, u, as shown in (B). The part of the tree shown as solid lines is now fixed and will not be changed in subsequent joining steps. The distances from node u to the nodes a-e are computed from equation (3). This process is then repeated, using a matrix of just the distances between the nodes, a,b,c,d,e, and u, and a Q matrix derived from it. In this case u and e are joined to the newly created v, as shown in (C). Two more iterations lead first to (D), and then to (E), at which point the algorithm is done, as the tree is fully resolved.

Neighbor joining takes as input a distance matrix specifying the distance between each pair of taxa. The algorithm starts with a completely unresolved tree, whose topology corresponds to that of a star network, and iterates over the following steps until the tree is completely resolved and all branch lengths are known:

  1. Based on the current distance matrix calculate the matrix Q (defined below).
  2. Find the pair of distinct taxa i and j (i.e. with i \neq j) for which Q(i,j) has its lowest value. These taxa are joined to a newly created node, which is connected to the central node. In the figure at right, f and g are joined to the new node u.
  3. Calculate the distance from each of the taxa in the pair to this new node.
  4. Calculate the distance from each of the taxa outside of this pair to the new node.
  5. Start the algorithm again, replacing the pair of joined neighbors with the new node and using the distances calculated in the previous step.

The Q-matrix

Based on a distance matrix relating the n taxa, calculate Q as follows:

Q(i,j)=(n-2)d(i,j)-\sum_{k=1}^n d(i,k) - \sum_{k=1}^n d(j,k)

 

 

 

 

(1)

where d(i,j) is the distance between taxa i and j.

Distance from the pair members to the new node

For each of the taxa in the pair being joined, use the following formula to calculate the distance to the new node:

\delta(f,u)=\frac{1}{2}d(f,g)+\frac{1}{2(n-2)} \left [ \sum_{k=1}^n d(f,k) - \sum_{k=1}^n d(g,k) \right ] \quad

 

 

 

 

(2)

and:

\delta(g,u)=d(f,g)-\delta(f,u) \quad

Taxa f and g are the paired taxa and u is the newly created node. The branches joining f and u and g and u, and their lengths, \delta(f,u) and \delta(g,u) are part of the tree which is gradually being created; they neither affect not are affected by later neighbor-joining steps.

Distance of the other taxa from the new node

For each taxon not considered in the previous step, we calculate the distance to the new node as follows:

d(u,k)=\frac{1}{2} [d(f,k)+d(g,k)-d(f,g)]

 

 

 

 

(3)

where u is the new node, k is the node which we want to calculate the distance to and f and g are the members of the pair just joined.

Complexity

Neighbor joining on a set of n taxa requires n-3 iterations. At each step one has to build and search a Q matrix. Initially the Q matrix is size n\times n, then the next step it is (n-1)\times(n-1), etc. Implementing this in a straightforward way leads to an algorithm with a time complexity of O(n^3); implementations exist which use heuristics to do much better than this on average.

Example

Neighbor joining with 5 taxa. In this case 2 neighbor joining steps give a tree with fully resolved topology. The branches of the resulting tree are labeled with their lengths.

Let us assume that we have five taxa (a,b,c,d,e) and the following distance matrix:

a b c d e
a 0 5 9 9 8
b 5 0 10 10 9
c 9 10 0 8 7
d 9 10 8 0 3
e 8 9 7 3 0

We obtain the following values for the Q matrix (the diagonal elements of the matrix are not used and are omitted here):

a b c d e
a −50 −38 −34 −34
b −50 −38 −34 −34
c −38 −38 −40 −40
d −34 −34 −40 −48
e −34 −34 −40 −48

In the example above, Q(a,b)=-50. This is the smallest value of Q, so we join nodes a and b. Let u denote the new node; the branches joining a and b to u then have lengths \delta(a,u)=2 and \delta(b,u)=3, by equation (2), above.

We then proceed to update the distance matrix; using equation (3) above, we compute the distance from u to each of the other nodes besides a and b. In this case, we obtain d(u,c)=7, d(u,d)=7, and d(u,e)=6. The resulting distance matrix is:

u c d e
u 0 7 7 6
c 7 0 8 7
d 7 8 0 3
e 6 7 3 0

The corresponding Q matrix is:

u c d e
u −28 −24 −24
c −28 −24 −24
d −24 −24 −28
e −24 −24 −28

We may choose either to join u and c, or to join d and e; both pairs have the minimal Q value of -28, and either choice leads to the same result. For concreteness, let us join u and c and call the new node v; this gives branch lengths \delta(u,v)=3 and \delta(c,v)=4 as shown in the figure, and the distance matrix for the remaining 3 nodes, v, d, and e, is:

v d e
v 0 4 3
d 4 0 3
e 3 3 0

The tree topology is fully resolved at this point, so we don't need to calculate Q or do any more joining of neighbors. However, we can use these distances to get the remaining 3 branch-lengths, as shown in the figure.

This example represents an idealized case: note that if we move from any taxon to any other along the branches of the tree, and sum the lengths of the branches traversed, the result is equal to the distance between those taxa in the input distance matrix. For example, going from d to b we have 2+2+3+3=10. A distance matrix whose distances agree in this way with some tree is said to be 'additive', a property which is rare in practice. Nonetheless it is important to note that, given an additive distance matrix as input, neighbor joining is guaranteed to find the tree whose distances between taxa agree with it.

Neighbor joining as minimum evolution

Neighbor joining may be viewed as a greedy algorithm for optimizing a tree according to the 'balanced minimum evolution'[4] (BME) criterion. For each topology, BME defines the tree length (sum of branch lengths) to be a particular weighted sum of the distances in the distance matrix, with the weights depending on the topology. The BME optimal topology is the one which minimizes this tree length. Neighbor joining at each step greedily joins that pair of taxa which will give the greatest decrease in the estimated tree length. This procedure is not guaranteed to find the topology which is optimal by the BME criterion, although it often does and is usually quite close.

Advantages and disadvantages

The main virtue of NJ is that it is fast, due in part to its being a polynomial-time algorithm. This makes it practical for analyzing large data sets (hundreds or thousands of taxa) and for bootstrapping, for which purposes other means of analysis (e.g. maximum parsimony, maximum likelihood) may be computationally prohibitive.

Neighbor joining has the property that if the input distance matrix is correct, then the output tree will be correct. Furthermore, the correctness of the output tree topology is guaranteed as long as the distance matrix is 'nearly additive', specifically if each entry in the distance matrix differs from the true distance by less than half of the shortest branch length in the tree.[5] In practice the distance matrix rarely satisfies this condition, but neighbor joining often constructs the correct tree topology anyway.[6] The correctness of neighbor joining for nearly additive distance matrices implies that it is statistically consistent under many models of evolution; given data of sufficient length, neighbor joining will reconstruct the true tree with high probability. Compared with UPGMA, neighbor joining has the advantage that it does not assume all lineages evolve at the same rate (molecular clock hypothesis).

Nevertheless, neighbor joining has been largely superseded by phylogenetic methods that do not rely on distance measures and offer superior accuracy under most conditions. Neighbor joining has the undesirable feature that it often assigns negative lengths to some of the branches.

Implementations and variants

There are many programs available implementing neighbor joining. RapidNJ and NINJA are fast implementations with typical run times proportional to approximately the square of the number of taxa. BIONJ and Weighbor are variants of neighbor joining which improve on its accuracy by making use of the fact that the shorter distances in the distance matrix are generally better known than the longer distances. FastME is an implementation of the closely related balanced minimum evolution method.

See also

References

  1. ^ Saitou. Kyushu Museum. 2002. February 2, 2007
  2. ^ , volume 4, issue 4, pp. 406-425, July 1987.Molecular Biology and EvolutionSaitou N, Nei M. "The neighbor-joining method: a new method for reconstructing phylogenetic trees."
  3. ^ Xavier Didelot (2010). "Sequence-Based Analysis of Bacterial Population Structures". In D. Ashley Robinson, Daniel Falush, Edward J. Feil. Bacterial Population Genetics in Infectious Disease. John Wiley and Sons. pp. 46–47.  
  4. ^ Gascuel O,  
  5. ^ Atteson K (1997). "The performance of neighbor-joining algorithms of phylogeny reconstruction", pp. 101–110. In Jiang, T., and Lee, D., eds., Lecture Notes in Computer Science, 1276, Springer-Verlag, Berlin. COCOON '97.
  6. ^ Mihaescu R, Levy D,  
Other sources
  • Studier JA, Keppler KJ (1988). "A note on the Neighbor-Joining algorithm of Saitou and Nei" (PDF). Mol Biol Evol 5 (6): 729–731.  
  • Martin Simonsen, Thomas Mailund, Christian N. S. Pedersen (2008). "Rapid Neighbour Joining" (PDF). Proceedings of WABI 5251: 113–122.  

External links

  • The Neighbor-Joining Method — a tutorial
This article was sourced from Creative Commons Attribution-ShareAlike License; additional terms may apply. World Heritage Encyclopedia content is assembled from numerous content providers, Open Access Publishing, and in compliance with The Fair Access to Science and Technology Research Act (FASTR), Wikimedia Foundation, Inc., Public Library of Science, The Encyclopedia of Life, Open Book Publishers (OBP), PubMed, U.S. National Library of Medicine, National Center for Biotechnology Information, U.S. National Library of Medicine, National Institutes of Health (NIH), U.S. Department of Health & Human Services, and USA.gov, which sources content from all federal, state, local, tribal, and territorial government publication portals (.gov, .mil, .edu). Funding for USA.gov and content contributors is made possible from the U.S. Congress, E-Government Act of 2002.
 
Crowd sourced content that is contributed to World Heritage Encyclopedia is peer reviewed and edited by our editorial staff to ensure quality scholarly research articles.
 
By using this site, you agree to the Terms of Use and Privacy Policy. World Heritage Encyclopedia™ is a registered trademark of the World Public Library Association, a non-profit organization.
 



Copyright © World Library Foundation. All rights reserved. eBooks from World eBook Library are sponsored by the World Library Foundation,
a 501c(4) Member's Support Non-Profit Organization, and is NOT affiliated with any governmental agency or department.