Distance matrices in phylogeny

<h2 id="distance-matrix-methods">Distance-matrix methods</h2>
<p>Distance-matrix methods of phylogenetic analysis explicitly rely on a measure of "genetic distance" between the sequences being classified, and therefore they start with a multiple sequence alignment (MSA) as an input. From it, they construct an all-to-all matrix describing the distance between each sequence pair. Finally, they construct a phylogenetic tree that places closely related sequences under the same <a href="/facts/Interior_node/RcXz9noF">interior node</a> and whose branch lengths closely reproduce the observed distances between sequences. The produced tree is either rooted or unrooted, depending on the algorithm used.
</p><p>Distance is often defined as the fraction of mismatches at aligned positions, with gaps either ignored or counted as mismatches.<a class="footnote-ref" id="fnref:1" href="#fn:1"><sup>1</sup></a>
</p><p>Distance-matrix methods are frequently used as the basis for progressive and iterative types of <a href="/facts/Multiple_sequence_alignment/en7c7SQs">multiple sequence alignment</a>.
</p><p>The main disadvantage of distance-matrix methods is their inability to efficiently use information about local high-variation regions that appear across multiple subtrees.<a class="footnote-ref" id="fnref:2" href="#fn:2"><sup>2</sup></a>
</p>
<h3>Neighbor-joining</h3>
<p class="note">Main article: <a href="/facts/Neighbour_joining/Yld9VDz5">Neighbour joining</a></p>
<p>Neighbor-joining methods apply general <a href="/facts/Data_clustering/HUeDnWPt">data clustering</a> techniques to sequence analysis using genetic distance as a clustering metric. The simple <a href="/facts/Neighbor-joining/Yld9VDz5">neighbor-joining</a> method produces unrooted trees, but it does not assume a constant rate of evolution (i.e., a <a href="/facts/Molecular_clock/wlM3LYmA">molecular clock</a>) across lineages.
</p>
<h3>UPGMA and WPGMA</h3>
<p class="note">Main article: <a href="/facts/UPGMA/XbJ1rIrl">UPGMA</a></p>
<p class="note">Main article: <a href="/facts/WPGMA/atY0kbpL">WPGMA</a></p>
<p>The <a href="/facts/UPGMA/XbJ1rIrl">UPGMA</a> (<i>Unweighted Pair Group Method with Arithmetic mean</i>) and <a href="/facts/WPGMA/atY0kbpL">WPGMA</a> (<i>Weighted Pair Group Method with Arithmetic mean</i>) methods produce rooted trees and require a constant-rate assumption – that is, it assumes an <a href="/facts/Ultrametric/QhJQBG9N">ultrametric</a> tree in which the distances from the root to every branch tip are equal.
</p>
<h3>Fitch–Margoliash method</h3>
<p>The Fitch–Margoliash method uses a weighted <a href="/facts/Least_squares/50jIwbxC">least squares</a> method for clustering based on genetic distance.<a class="footnote-ref" id="fnref:3" href="#fn:3"><sup>3</sup></a> Closely related sequences are given more weight in the tree construction process to correct for the increased inaccuracy in measuring distances between distantly related sequences. In practice, the distance correction is only necessary when the evolution rates differ among branches.<a class="footnote-ref" id="fnref:4" href="#fn:4"><sup>4</sup></a> The distances used as input to the algorithm must be normalized to prevent large artifacts in computing relationships between closely related and distantly related groups. The distances calculated by this method must be <a href="/facts/Linear/fChtg3KC">linear</a>; the linearity criterion for distances requires that the <a href="/facts/Expected_value/1XV0JKL8">expected values</a> of the branch lengths for two individual branches must equal the expected value of the sum of the two branch distances – a property that applies to biological sequences only when they have been corrected for the possibility of <a href="/facts/Mutation/Ee4NnWbY">back mutations</a> at individual sites. This correction is done through the use of a <a href="/facts/Substitution_matrix/4IEqRNH8">substitution matrix</a> such as that derived from the <a href="/facts/Jukes%25E2%2580%2593Cantor_model/RucLKH0e">Jukes–Cantor model</a> of DNA evolution. 
</p><p>The least-squares criterion applied to these distances is more accurate but less efficient than the neighbor-joining methods. An additional improvement that corrects for correlations between distances that arise from many closely related sequences in the data set can also be applied at increased computational cost. Finding the optimal least-squares tree with any correction factor is <a href="/facts/NP-complete/NFPv56DU">NP-complete</a>,<a class="footnote-ref" id="fnref:5" href="#fn:5"><sup>5</sup></a> so <a href="/facts/Heuristic/BcBEkv9c">heuristic</a> search methods like those used in maximum-parsimony analysis are applied to the search through tree space.
</p>
<h3>Using outgroups</h3>
<p>Independent information about the relationship between sequences or groups can be used to help reduce the tree search space and root unrooted trees. Standard usage of distance-matrix methods involves the inclusion of at least one <a href="/facts/Outgroup_(cladistics)/XnAuxXsV">outgroup</a> sequence known to be only distantly related to the sequences of interest in the query set.<a class="footnote-ref" id="fnref:6" href="#fn:6"><sup>6</sup></a> This usage can be seen as a type of <a href="/facts/Experimental_control/FXHfQwHx">experimental control</a>. If the outgroup has been appropriately chosen, it will have a much greater <a href="/facts/Genetic_distance/bx0UaXvH">genetic distance</a> and thus a longer branch length than any other sequence, and it will appear near the root of a rooted tree. Choosing an appropriate outgroup requires the selection of a sequence that is moderately related to the sequences of interest; too close a relationship defeats the purpose of the outgroup and too distant adds <a href="/facts/Signal_noise/Izbv38Rr">noise</a> to the analysis.<a class="footnote-ref" id="fnref:7" href="#fn:7"><sup>7</sup></a> Care should also be taken to avoid situations in which the species from which the sequences were taken are distantly related, but the gene encoded by the sequences is highly <a href="/facts/Conservation_(genetics)/YAxy2Xa2">conserved</a> across lineages. <a href="/facts/Horizontal_gene_transfer/FPyUIsf2">Horizontal gene transfer</a>, especially between otherwise divergent <a href="/facts/Bacteria/wC8xSCsU">bacteria</a>, can also confound outgroup usage.
</p>
<h3>Weaknesses of different methods</h3>
<p>In general, pairwise distance data are an underestimate of the path-distance between taxa on a <a href="/facts/Phylogram/f5vVEpeY">phylogram</a>. Pairwise distances effectively "cut corners" in a manner analogous to geographic distance: the distance between two cities may be 100 miles "as the crow flies," but a traveler may actually be obligated to travel 120 miles because of the layout of roads, the terrain, stops along the way, etc. Between pairs of taxa, some character changes that took place in ancestral lineages will be undetectable, because later changes have erased the evidence (often called multiple hits and <a href="/facts/Mutation/Ee4NnWbY">back mutations</a> in sequence data). This problem is common to all phylogenetic estimation, but it is particularly acute for distance methods, because only two samples are used for each distance calculation; other methods benefit from evidence of these hidden changes found in other taxa not considered in pairwise comparisons. For <a href="/facts/Nucleotide/pQKEwlJI">nucleotide</a> and <a href="/facts/Amino_acid/WDxYwBny">amino acid</a> sequence data, the same stochastic models of nucleotide change used in maximum likelihood analysis can be employed to "correct" distances, rendering the analysis "semi-parametric."
</p><p>Several simple algorithms exist to construct a tree directly from pairwise distances, including <a href="/facts/UPGMA/XbJ1rIrl">UPGMA</a> and <a href="/facts/Neighbor_joining/Yld9VDz5">neighbor joining</a> (NJ), but these will not necessarily produce the best tree for the data. To counter potential complications noted above, and to find the best tree for the data, distance analysis can also incorporate a tree-search protocol that seeks to satisfy an explicit optimality criterion. Two optimality criteria are commonly applied to distance data, <a href="/facts/Minimum_evolution/PXFD3g9J">minimum evolution</a> (ME) and <a href="/facts/Least_squares_inference_in_phylogeny/6SHFWzw6">least squares inference</a>. Least squares is part of a broader class of regression-based methods lumped together here for simplicity. These regression formulae minimize the residual differences between path-distances along the tree and pairwise distances in the data matrix, effectively "fitting" the tree to the empirical distances. In contrast, ME accepts the tree with the shortest sum of branch lengths, and thus minimizes the total amount of evolution assumed. ME is closely akin to parsimony, and under certain conditions, ME analysis of distances based on a discrete character dataset will favor the same tree as conventional parsimony analysis of the same data.
</p><p>Phylogeny estimation using distance methods has produced a number of controversies. <a href="/facts/UPGMA/XbJ1rIrl">UPGMA</a> assumes an <a href="/facts/Ultrametric/QhJQBG9N">ultrametric</a> tree (a tree where all the path-lengths from the root to the tips are equal). If the rate of evolution were equal in all sampled lineages (a <a href="/facts/Molecular_clock/wlM3LYmA">molecular clock</a>), and if the tree were completely balanced (equal numbers of taxa on both sides of any split, to counter the node density effect), UPGMA should not produce a biased result. These expectations are not met by most datasets, and although UPGMA is somewhat robust to their violation, it is not commonly used for phylogeny estimation. The advantage of UPGMA is that it is fast and can handle many sequences.
</p><p><a href="/facts/Neighbor-joining/Yld9VDz5">Neighbor-joining</a> is a form of star decomposition and, as a <a href="/facts/Heuristic/BcBEkv9c">heuristic</a> method, is generally the least computationally intensive of these methods. It is very often used on its own, and in fact quite frequently produces reasonable trees. However, it lacks any sort of tree search and optimality criterion, and so there is no guarantee that the recovered tree is the one that best fits the data. A more appropriate analytical procedure would be to use NJ to produce a starting tree, then employ a tree search using an optimality criterion, to ensure that the best tree is recovered.
</p><p>Many scientists eschew distance methods, for various reasons. A commonly cited reason is that distances are inherently <a href="/facts/Phenetic/aTqXrJEl">phenetic</a> rather than <a href="/facts/Phylogenetic/bw4rsovt">phylogenetic</a>, in that they do not distinguish between ancestral similarity (<a href="/facts/Symplesiomorphy/n5K8vSKd">symplesiomorphy</a>) and derived similarity (<a href="/facts/Synapomorphy/t21GWRl1">synapomorphy</a>). This criticism is not entirely fair: most currently implementations of parsimony, likelihood, and Bayesian phylogenetic inference use time-reversible character models, and thus accord no special status to derived or ancestral character states. Under these models, the tree is estimated unrooted; rooting, and consequently determination of polarity, is performed after the analysis. The primary difference between these methods and distances is that parsimony, likelihood, and Bayesian methods fit individual characters to the tree, whereas distance methods fit all the characters at once. There is nothing inherently less phylogenetic about this approach.
</p><p>More practically, distance methods are avoided because the relationship between individual characters and the tree is lost in the process of reducing characters to distances. These methods do not use character data directly, and information locked in the distribution of character states can be lost in the pairwise comparisons. Also, some complex phylogenetic relationships may produce biased distances. On any phylogram, branch lengths will be underestimated because some changes cannot be discovered at all due to failure to sample some species due to either experimental design or extinction (a phenomenon called the node density effect). However, even if pairwise distances from genetic data are "corrected" using stochastic models of evolution as mentioned above, they may more easily sum to a different tree than one produced from analysis of the same data and model using <a href="/facts/Maximum_likelihood/0Yq2dpQD">maximum likelihood</a>. This is because pairwise distances are not independent; each branch on a tree is represented in the distance measurements of all taxa it separates. Error resulting from any characteristic of that branch that might confound phylogeny (stochastic variability, change in evolutionary parameters, an abnormally long or short branch length) will be propagated through all of the relevant distance measurements. The resulting distance matrix may then better fit an alternate (presumably less optimal) tree.
</p><p>Despite these potential problems, distance methods are extremely fast, and they often produce a reasonable estimate of phylogeny. They also have certain benefits over the methods that use characters directly. Notably, distance methods allow use of data that may not be easily converted to character data, such as <a href="/facts/DNA-DNA_hybridization/zBK34KBY">DNA-DNA hybridization</a> assays. They also permit analyses that account for the possibility that the rate at which particular nucleotides are incorporated into sequences may vary over the tree, using LogDet distances. For some network-estimation methods (notably <a href="/facts/NeighborNet/4ozlg6ba">NeighborNet</a>), the abstraction of information about individual characters in distance data are an advantage. When considered character-by character, conflict between character and a tree due to reticulation cannot be told from conflict due either to homoplasy or error. However, pronounced conflict in distance data, which represents an amalgamation of many characters, is less likely due to error or homoplasy unless the data are strongly biased, and is thus more likely to be a result of reticulation.
</p><p>Distance methods are popular among molecular systematists, a substantial number of whom use NJ without an optimization stage almost exclusively. With the increasing speed of character-based analyses, some of the advantages of distance methods will probably wane. However, the nearly instantaneous NJ implementations, the ability to incorporate an evolutionary model in a speedy analysis, LogDet distances, network estimation methods, and the occasional need to summarize relationships with a single number all mean that distance methods will probably stay in the mainstream for a long time to come.
</p>
<h2 id="see-also">See also</h2>
<ul><li><a href="/facts/List_of_phylogenetics_software/dweymj0c">List of phylogenetics software</a></li></ul>

<h2 id="references">References</h2>

<ol>
<li id="fn:1"><p>Mount DM. (2004). Bioinformatics: Sequence and Genome Analysis 2nd ed. Cold Spring Harbor Laboratory Press: Cold Spring Harbor, NY. <a href="#fnref:1" class="footnote-back-ref">↩</a></p></li>
<li id="fn:2"><p>Felsenstein J. (2004). Inferring Phylogenies Sinauer Associates: Sunderland, MA. <a href="#fnref:2" class="footnote-back-ref">↩</a></p></li>
<li id="fn:3"><p>Fitch WM; Margoliash E (1967). "Construction of phylogenetic trees". Science. 155 (3760): 279–284. Bibcode:1967Sci...155..279F. doi:10.1126/science.155.3760.279. PMID 5334057. <a href="/wiki/Bibcode_(identifier)" target="_blank">/wiki/Bibcode_(identifier)</a> <a href="#fnref:3" class="footnote-back-ref">↩</a></p></li>
<li id="fn:4"><p>Felsenstein J. (2004). Inferring Phylogenies Sinauer Associates: Sunderland, MA. <a href="#fnref:4" class="footnote-back-ref">↩</a></p></li>
<li id="fn:5"><p>Day, WHE (1986). "Computational complexity of inferring phylogenies from dissimilarity matrices". Bulletin of Mathematical Biology. 49 (4): 461–7. doi:10.1007/BF02458863. PMID 3664032. <a href="/wiki/Doi_(identifier)" target="_blank">/wiki/Doi_(identifier)</a> <a href="#fnref:5" class="footnote-back-ref">↩</a></p></li>
<li id="fn:6"><p>Mount DM. (2004). Bioinformatics: Sequence and Genome Analysis 2nd ed. Cold Spring Harbor Laboratory Press: Cold Spring Harbor, NY. <a href="#fnref:6" class="footnote-back-ref">↩</a></p></li>
<li id="fn:7"><p>Mount DM. (2004). Bioinformatics: Sequence and Genome Analysis 2nd ed. Cold Spring Harbor Laboratory Press: Cold Spring Harbor, NY. <a href="#fnref:7" class="footnote-back-ref">↩</a></p></li>
</ol>

Distance matrices in phylogeny open-in-new

Distance matrices in phylogeny