View source for BIN-PHYLO-Tree building

<div id="ABC">
<div style="padding:5px; border:1px solid #000000; background-color:#b3dbce; font-size:300%; font-weight:400; color: #000000; width:100%;">
Building Phylogenetic Trees
<div style="padding:5px; margin-top:20px; margin-bottom:10px; background-color:#b3dbce; font-size:30%; font-weight:200; color: #000000; ">
(Calculating phylogenetic trees; tree visualization)
</div>
</div>

{{Smallvspace}}


<div style="padding:5px; border:1px solid #000000; background-color:#b3dbce33; font-size:85%;">
<div style="font-size:118%;">
<b>Abstract:</b><br />
<section begin=abstract />
Building phylogenetic trees in theory - and with phylip in R.
<section end=abstract />
</div>
<!-- ============================  -->
<hr>
<table>
<tr>
<td style="padding:10px;">
<b>Objectives:</b><br />
This unit will ...
* ... introduce the concepts and algorithms used to build phylogenetic trees;
* ... teach how to compute a maximum likelihood tree with the PHYLIP proml program in R;
</td>
<td style="padding:10px;">
<b>Outcomes:</b><br />
After working through this unit you ...
* ... are familar with concepts and algorithms used to build phylogenetic trees;
* ... have computed a phylogenetic tree of Mbp1 orthologue APSES domains with the PHYLIP proml program via the <tt>RPhylip::</tt> package.
</td>
</tr>
</table>
<!-- ============================  -->
<hr>
<b>Deliverables:</b><br />
<section begin=deliverables />
<li><b>Time management</b>: Before you begin, estimate how long it will take you to complete this unit. Then, record in your course journal: the number of hours you estimated, the number of hours you worked on the unit, and the amount of time that passed between start and completion of this unit.</li>
<li><b>Journal</b>: Document your progress in your [[FND-Journal|Course Journal]]. Some tasks may ask you to include specific items in your journal. Don't overlook these.</li>
<li><b>Insights</b>: If you find something particularly noteworthy about this unit, make a note in your [[ABC-Insights|'''insights!''' page]].</li>
<section end=deliverables />
<!-- ============================  -->
<hr>
<section begin=prerequisites />
<b>Prerequisites:</b><br />
You need the following preparation before beginning this unit. If you are not familiar with this material from courses you took previously, you need to prepare yourself from other information sources:<br />
*<b>Evolution</b>: Theory of evolution; variation, neutral drift and selection.
This unit builds on material covered in the following prerequisite units:<br />
*[[BIN-PHYLO-Data_preparation|BIN-PHYLO-Data_preparation (Preparing Data for Phylogenetic Analysis)]]
<section end=prerequisites />
<!-- ============================  -->
</div>

{{Smallvspace}}



{{Smallvspace}}


__TOC__

{{Vspace}}


=== Evaluation ===
<b>Evaluation: NA</b><br />
<div style="margin-left: 2rem;">This unit is not evaluated for course marks.</div>
== Contents ==


{{Task|1=
*Read the introductory notes on {{ABC-PDF|BIN-PHYLO-Tree_building|building phylogenetic trees}}.
* Also read:
{{#pmid:32424311}}

}}


{{Vspace}}

<div class="colmask doublepage">
  <div class="colleft">
    <div class="col1">
      <!-- Column 1 start -->

The result of the tree construction is a decision about the most likely evolutionary relationships. Fundamentally, tree-construction programs decide which sequences had common ancestors.

;"Distance based" and "Parsimony based" methods are fast, but less acurate.

'''Distance based''' phylogeny programs start by using sequence comparisons to estimate evolutionary distances:

* they apply a model of evolution such as a mutation data matrix, to calculate a score for each pair of sequences,
* this score is stored in a "distance matrix" ...
* ... and used to estimate a tree that groups sequences with close relationships together. (e.g. by using an NJ, Neigbor Joining, algorithm).

They are fast, can work on large numbers of sequences, but are less accurate if genes evolve at different rates.


'''Parsimony based''' phylogeny programs build a tree that minimizes the number of mutation events that are required to get from a common ancestral sequence to all observed sequences. They take all columns into account, not just a single number per sequence pair, as the Distance Methods do. For closely related sequences they work very well, but they construct inaccurate trees when they can't make good estimates for the required number of sequence changes.


      <!-- Column 1 end -->
    </div>
    <div class="col2">
      <!-- Column 2 start -->
;"Maximum Likelihood" and "Bayesian" methods are accurate, but can take up very significant computational resources.

'''ML''', or '''Maximum Likelihood''' methods attempt to find the tree for which the observed sequences would be the most likely under a particular evolutionary model. They are based on a rigorous statistical framework and yield the most robust results. But they are also quite compute intensive and a tree of the size that we are building in this assignment is a challenge for the resources of common workstation (runs about an hour on my computer). If the problem is too large, one may split a large problem into smaller, obvious subtrees (e.g. analysing orthologues as a group, only including a few paralogues for comparison) and then merge the smaller trees; this way even very large problems can become tractable.

ML methods suffer less from "long-branch attraction" - the phenomenon that weakly similar sequences can be grouped inappropriately close together in a tree due to spuriously shared differences.


'''Bayesian''' methods don't estimate the tree that gives the highest likelihood for the observed data, but find the most probable tree, given the data that has been observed. If you think this sounds conceptually similar to ML methods, then you are not wrong. However, the approaches employ very different algorithms. And Bayesian methods need a "prior" on trees before observation.


      <!-- Column 2 end -->
    </div>
  </div>
</div>

==Calculating trees==

{{Vspace}}

In this section we perform the actual phylogenetic calculation.

{{Vspace}}

{{task|1=

* Download the PHYLIP suite of programs from the [http://evolution.genetics.washington.edu/phylip.html Phylip homepage] and install it on your computer.

}}

{{Smallvspace}}

{{ABC-unit|BIN-PHYLO-Tree_building.R}}


{{Vspace}}

<!-- Bootstrapping ...
* run seqboot
* rename outfile to infile
* rerun proml, use option M for multiple datasets with speedy option (use "jumble" of 1)
* rename outtree to intree
* run consense
* Use option R to define trees as rooted

Should run at least overnight.
-->


== Further reading, links and resources ==

:* [http://evolution.genetics.washington.edu/phylip.html '''PHYLIP''' home page]
:* [http://evolution.genetics.washington.edu/phylip/phylip.html '''PHYLIP''' documentation]
{{PDF
|authors= Tuimala, Jarno
|year= 2006
|title= A primer to phylogenetic analysis using the PHYLIP package
|journal=
|volume=
|pages=
|URL= http://koti.mbnet.fi/tuimala/oppaat/phylip2.pdf
|doi=
|file= Tuimala_PHYLIP.pdf
|abstract= The purpose of this tutorial is to demonstrate how to use PHYLIP, a collection of phylogenetic analysis software, and some of the options that are available. This tutorial is not intended to be a course in phylogenetics, although some phylogenetic concepts will be discussed briefly. There are other books available which cover the theoretical sides of the phylogenetic analysis, but the actual data analysis work is less well covered. Here we will mostly deal with molecular sequence data analysis in the current PHYLIP version 3.66.
}}

== Notes ==
<references />

{{Vspace}}


<div class="about">
<b>About ... </b><br />
&nbsp;<br />
<b>Author:</b><br />
:Boris Steipe <boris.steipe@utoronto.ca>
<b>Created:</b><br />
:2017-08-05
<b>Modified:</b><br />
:2020-09-25
<b>Version:</b><br />
:1.1
<b>Version history:</b><br />
*1.1 2020 Maintenance
*1.0 First live version.
*0.1 First stub
</div>

{{CC-BY}}

[[Category:ABC-units]]
{{UNIT}}
{{LIVE}}
</div>
<!-- [END] -->