|
|
| Line 1: |
Line 1: |
| [[File:Neighbor-joining Tree-2.png|thumb|right|350px|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 {{nihongo||斎藤成也}} professor at the (Japanese) National Institute for Genetics.<ref>[http://www.museum.kyushu-u.ac.jp/WAJIN/113.html Saitou. Kyushu Museum. 2002. February 2, 2007]</ref>]]
| | The name of the writer is Jayson. Office supervising is where her main income comes from. For a while I've been in Alaska but I will have to move in a year or two. It's not a typical thing but what she likes doing is to perform domino but she doesn't have the time recently.<br><br>Have a look at my web site clairvoyants [[http://www.jsfran.or.kr/xe/board_JjqT75/88262 enquiry]] |
| | |
| In [[bioinformatics]], '''neighbor joining''' is a bottom-up clustering method for the creation of [[phenetic]] [[phylogenetic trees|trees]] (phenograms), created by [[Naruya Saitou]] and [[Masatoshi Nei]] in 1987.<ref>[http://mbe.oxfordjournals.org/content/4/4/406.long Saitou N, Nei M. "The neighbor-joining method: a new method for reconstructing phylogenetic trees." ''Molecular Biology and Evolution'', volume 4, issue 4, pp. 406-425, July 1987.]</ref> Usually used for trees based on [[DNA]] or [[protein]] [[primary structure|sequence]] data, the algorithm requires knowledge of the distance between each pair of [[taxa]] (e.g., species or sequences) to form the tree.<ref>
| |
| {{cite book
| |
| | title = Bacterial Population Genetics in Infectious Disease
| |
| | editor = D. Ashley Robinson, Daniel Falush, Edward J. Feil
| |
| | chapter = Sequence-Based Analysis of Bacterial Population Structures
| |
| | author = Xavier Didelot
| |
| | publisher = John Wiley and Sons
| |
| | year = 2010
| |
| | isbn = 978-0-470-42474-2
| |
| | pages = 46–47
| |
| | url = http://books.google.com/books?id=gPVjfsWnGCcC&pg=PA46
| |
| }}</ref>
| |
| | |
| == The algorithm ==
| |
| [[File:Neighbor-joining 7 taxa start to finish.png|thumb|right|400px|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 dotted 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 the formula given in the text. 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:
| |
| | |
| # Based on the current distance matrix calculate the matrix <math>Q</math> (defined below).
| |
| # Find the pair of taxa for which <math>Q(i,j)</math> has its lowest value. Add a new node to the tree, joining these taxa to the rest of the tree. In the figure at right, f and g are joined to the tree by the new node u.
| |
| # Calculate the distance from each of the [[taxon|taxa]] in the pair to this new node.
| |
| # Calculate the distance from each of the taxa outside of this pair to the new node.
| |
| # 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 <math>r</math> taxa, calculate <math>Q</math> as follows:
| |
| | |
| : <math>Q(i,j)=(r-2)d(i,j)-\sum_{k=1}^r d(i,k) - \sum_{k=1}^r d(j,k)</math>
| |
| | |
| where <math>d(i,j)</math> is the distance between taxa <math>i</math> and <math>j</math>, and <math>k</math> is any other node not <math>i</math> or <math>j</math>.
| |
| | |
| === Distance of the pair members to the new node ===
| |
| | |
| For each neighbor in the pair just joined, use the following formula to calculate the distance to the new node. (Taxa <math>f</math> and <math>g</math> are the paired taxa and <math>u</math> is the newly generated node.):
| |
| | |
| : <math>d(f,u)=\frac{1}{2}d(f,g)+\frac{1}{2(r-2)} \left [ \sum_{k=1}^r d(f,k) - \sum_{k=1}^r d(g,k) \right ] \quad </math>
| |
| and, by reflection:
| |
| : <math>d(g,u)=d(f,g)-d(f,u) \quad </math>
| |
| | |
| === Distance of the other taxa to the new node ===
| |
| | |
| For each taxon not considered in the previous step, we calculate the distance to the new node as follows:
| |
| | |
| : <math>d(u,k)=\frac{1}{2} [d(f,k)+d(g,k)-d(f,g)]</math>
| |
| | |
| where <math>u</math> is the new node, <math>k</math> is the node for which we want to calculate the distance to and <math>f</math> and <math>g</math> are the members of the pair just joined.
| |
| | |
| === Complexity ===
| |
| | |
| Neighbor joining on a set of <math>r</math> taxa requires <math>r-3</math> iterations. At each step one has to build and search a <math>Q</math> matrix. Initially the <math>Q</math> matrix is size <math>r\times r</math>, then the next step it is <math>(r-1)\times(r-1)</math>, etc. This leads to an algorithm with a time complexity of <math>O(r^3)</math>.
| |
| | |
| == Example ==
| |
| [[File:Neighbor-joining 4 taxa.svg|thumb|right|260px|Neighbor joining with 4 taxa. In this case just one neighbor joining step gives a tree with fully resolved topology. The branches of the resulting tree are labeled with their lengths.]]
| |
| | |
| Let us assume that we have four taxa (A, B, C, D) and the following distance matrix:
| |
| | |
| {| class="wikitable"
| |
| |-
| |
| !
| |
| ! A
| |
| ! B
| |
| ! C
| |
| ! D
| |
| |-
| |
| ! A
| |
| | 0
| |
| | 7
| |
| | 11
| |
| | 14
| |
| |-
| |
| ! B
| |
| | 7
| |
| | 0
| |
| | 6
| |
| | 9
| |
| |-
| |
| ! C
| |
| | 11
| |
| | 6
| |
| | 0
| |
| | 7
| |
| |-
| |
| ! D
| |
| | 14
| |
| | 9
| |
| | 7
| |
| | 0
| |
| |}
| |
| | |
| We obtain the following values for the Q matrix:
| |
| <!-- THIS ASSUMES THAT Q(i,i)=0 FOR ALL i AND SHOULD BE EXPLICITLY STATED -->
| |
| | |
| {| class="wikitable"
| |
| |-
| |
| !
| |
| ! A
| |
| ! B
| |
| ! C
| |
| ! D
| |
| |-
| |
| ! A
| |
| | 0
| |
| | −40
| |
| | −34
| |
| | −34
| |
| |-
| |
| ! B
| |
| | −40
| |
| | 0
| |
| | −34
| |
| | −34
| |
| |-
| |
| ! C
| |
| | −34
| |
| | −34
| |
| | 0
| |
| | −40
| |
| |-
| |
| ! D
| |
| | −34
| |
| | −34
| |
| | −40
| |
| | 0
| |
| |}
| |
| | |
| In the example above, two pairs of taxa have the lowest value, namely −40. We can select either of them for the second step of the algorithm. We follow the example assuming that we joined taxa A and B together.
| |
| If <math>u</math> denotes the new node, then the branch lengths of edges <math>\{A, u\}</math> and <math>\{B, u\}</math> are respectively 6 and 1, by the above formula.
| |
| | |
| We then proceed to updating the distance matrix, by computing <math>d(u,k)</math> according to the above formula for every node <math>k</math>. In this case, we obtain <math>d(u,C)=5</math> and <math>d(u,D)=8</math>. The resulting distance matrix is:
| |
| | |
| {| class="wikitable"
| |
| |-
| |
| !
| |
| ! u
| |
| ! C
| |
| ! D
| |
| |-
| |
| ! u
| |
| | 0
| |
| | 5
| |
| | 8
| |
| |-
| |
| ! C
| |
| | 5
| |
| | 0
| |
| | 7
| |
| |-
| |
| ! D
| |
| | 8
| |
| | 7
| |
| | 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 <math>5 + 3 + 1 = 9</math>. 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'<ref name="gascuel">{{cite journal |author=Gascuel O, [[Mike Steel (mathematician)|Steel M]] |title=Neighbor-joining revealed |journal=Mol Biol Evol |volume=23 |issue=11 |pages=1997–2000 |year=2006 |doi=10.1093/molbev/msl072 |pmid=16877499}}</ref> (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 (statistics)|bootstrapping]], for which purposes other means of analysis (e.g. [[maximum parsimony]], [[maximum likelihood]]) may be [[computation]]ally 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.<ref>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.</ref>
| |
| In practice the distance matrix rarely satisfies this condition, but neighbor joining often constructs the correct tree topology anyway.<ref name="levy">{{cite journal |author=Mihaescu R, Levy D, Pachter L |title=Why neighbor-joining works |journal=Algorithmica |volume=54 |issue=1| pages=1–24 |year=2009 | url = http://arxiv.org/abs/cs.DS/0602041 | doi=10.1007/s00453-007-9116-4}}</ref> The correctness of neighbor joining for nearly additive distance matrices implies that it is [[statistical consistency|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.{{citation needed|date=November 2012}} 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.
| |
| [http://birc.au.dk/Software/RapidNJ/ RapidNJ],
| |
| [http://www.daimi.au.dk/~mailund/quick-join.html QuickJoin] and | |
| [http://nimbletwist.com/software/ninja/ NINJA]
| |
| are fast implementations which run in <math>O(r^3)</math> time in the worst case, but do better on average.
| |
| [http://www.atgc-montpellier.fr/bionj/ BIONJ] and [http://www.t6.lanl.gov/billb/weighbor/ 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. [http://www.ncbi.nlm.nih.gov/CBBresearch/Desper/FastME FastME] is an implementation of the closely related balanced minimum evolution method.
| |
| | |
| ==See also==
| |
| | |
| *[[Human genetic clustering]]
| |
| *[[Nearest neighbor search]]
| |
| *[[UPGMA]]
| |
| | |
| == References ==
| |
| | |
| {{Reflist|2}}
| |
| | |
| ;Other sources
| |
| | |
| {{refbegin}}
| |
| * {{cite journal |author=Studier JA, Keppler KJ |title=A note on the Neighbor-Joining algorithm of Saitou and Nei |journal=Mol Biol Evol |volume=5 |issue=6 |pages=729–731 |year=1988 |pmid=3221794 |url=http://mbe.oxfordjournals.org/cgi/reprint/5/6/729.pdf}}
| |
| * {{cite journal |author=Martin Simonsen, Thomas Mailund, Christian N. S. Pedersen |title=Rapid Neighbour Joining |journal=Proceedings of WABI |year=2008 |doi=10.1007/978-3-540-87361-7_10 |url=http://birc.au.dk/fileadmin/uploaded/rapidNJ.pdf |volume=5251 |pages=113–122}}
| |
| {{refend}}
| |
| | |
| ==External links==
| |
| *[http://www.icp.be/~opperd/private/neighbor.html The Neighbor-Joining Method] — a tutorial
| |
| | |
| {{Phylogenetics}}
| |
| | |
| {{DEFAULTSORT:Neighbor-Joining}}
| |
| [[Category:Bioinformatics algorithms]]
| |
| [[Category:Phylogenetics]]
| |
| [[Category:Computational phylogenetics]]
| |
| [[Category:Data clustering algorithms]]
| |