Tutorial 5 Phylogenetic Trees.

Slides:



Advertisements
Similar presentations
Computing a tree Genome 559: Introduction to Statistical and Computational Genomics Prof. James H. Thomas.
Advertisements

Phylogenetic Tree A Phylogeny (Phylogenetic tree) or Evolutionary tree represents the evolutionary relationships among a set of organisms or groups of.
. Class 9: Phylogenetic Trees. The Tree of Life Evolution u Many theories of evolution u Basic idea: l speciation events lead to creation of different.
Multiple Sequence Alignment & Phylogenetic Trees.
Computing a tree Genome 559: Introduction to Statistical and Computational Genomics Prof. James H. Thomas.
Lecture 13 CS5661 Phylogenetics Motivation Concepts Algorithms.
Phylogenetics - Distance-Based Methods CIS 667 March 11, 2204.
Phylogenetic trees Sushmita Roy BMI/CS 576 Sep 23 rd, 2014.
Molecular Evolution Revised 29/12/06
Problem Set 2 Solutions Tree Reconstruction Algorithms
UPGMA Algorithm.  Main idea: Group the taxa into clusters and repeatedly merge the closest two clusters until one cluster remains  Algorithm  Add a.
Lecture 7 – Algorithmic Approaches Justification: Any estimate of a phylogenetic tree has a large variance. Therefore, any tree that we can demonstrate.
CENTER FOR BIOLOGICAL SEQUENCE ANALYSIS Phylogenetic Reconstruction: Distance Matrix Methods Anders Gorm Pedersen Molecular Evolution Group Center for.
. Computational Genomics 5a Distance Based Trees Reconstruction (cont.) Modified by Benny Chor, from slides by Shlomo Moran and Ydo Wexler (IIT)
. Class 5: Multiple Sequence Alignment. Multiple sequence alignment VTISCTGSSSNIGAG-NHVKWYQQLPG VTISCTGTSSNIGS--ITVNWYQQLPG LRLSCSSSGFIFSS--YAMYWVRQAPG.
Distance methods. UPGMA: similar to hierarchical clustering but not additive Neighbor-joining: more sophisticated and additive What is additivity?
The Tree of Life From Ernst Haeckel, 1891.
. Multiple Sequence Alignment Tutorial #4 © Ilan Gronau.
Pattern Recognition Introduction to bioinformatics 2005 Lecture 4.
CISC667, F05, Lec15, Liao1 CISC 667 Intro to Bioinformatics (Fall 2005) Phylogenetic Trees (II) Distance-based methods.
Phylogenetic Trees Tutorial 6. Measuring distance Bottom-up algorithm (Neighbor Joining) –Distance based algorithm –Relative distance based Phylogenetic.
Multiple sequence alignment
. Class 9: Phylogenetic Trees. The Tree of Life D’après Ernst Haeckel, 1891.
Phylogeny Tree Reconstruction
Phylogenetic Trees Tutorial 6. Measuring distance Bottom-up algorithm (Neighbor Joining) –Distance based algorithm –Relative distance based Phylogenetic.
Building Phylogenies Distance-Based Methods. Methods Distance-based Parsimony Maximum likelihood.
. Multiple Sequence Alignment Tutorial #4 © Ilan Gronau.
Phylogenetic Tree Construction and Related Problems Bioinformatics.
Phylogenetic trees Tutorial 6. Distance based methods UPGMA Neighbor Joining Tools Mega phylogeny.fr DrewTree Phylogenetic Trees.
Phylogenetic trees Sushmita Roy BMI/CS 576
Multiple Sequence Alignment CSC391/691 Bioinformatics Spring 2004 Fetrow/Burg/Miller (Slides by J. Burg)
1 Summary on similarity search or Why do we care about far homologies ? A protein from a new pathogenic bacteria. We have no idea what it does A protein.
1 Chapter 7 Building Phylogenetic Trees. 2 Contents Phylogeny Phylogenetic trees How to make a phylogenetic tree from pairwise distances –UPGMA method.
Phylogenetic Analysis. General comments on phylogenetics Phylogenetics is the branch of biology that deals with evolutionary relatedness Uses some measure.
Computational Biology, Part D Phylogenetic Trees Ramamoorthi Ravi/Robert F. Murphy Copyright  2000, All rights reserved.
BINF6201/8201 Molecular phylogenetic methods
Bioinformatics 2011 Molecular Evolution Revised 29/12/06.
Taking the Bite (Byte?) Out of Phylogeny Jennifer Galovich Lucy Kluckhohn Jones Holly Pinkart.
Applied Bioinformatics Week 8 Jens Allmer. Practice I.
OUTLINE Phylogeny UPGMA Neighbor Joining Method Phylogeny Understanding life through time, over long periods of past time, the connections between all.
Phylogenetic Prediction Lecture II by Clarke S. Arnold March 19, 2002.
Phylogenetic Trees Tutorial 5. Agenda How to construct a tree using Neighbor Joining algorithm Phylogeny.fr tool Cool story of the day: Horizontal gene.
Building phylogenetic trees. Contents Phylogeny Phylogenetic trees How to make a phylogenetic tree from pairwise distances  UPGMA method (+ an example)
Calculating branch lengths from distances. ABC A B C----- a b c.
Using Traveling Salesman Problem Algorithms to Determine Multiple Sequence Alignment Orders Weiwei Zhong.
Evolutionary tree reconstruction (Chapter 10). Early Evolutionary Studies Anatomical features were the dominant criteria used to derive evolutionary relationships.
394C, Spring 2013 Sept 4, 2013 Tandy Warnow. DNA Sequence Evolution AAGACTT TGGACTTAAGGCCT -3 mil yrs -2 mil yrs -1 mil yrs today AGGGCATTAGCCCTAGCACTT.
Evolutionary tree reconstruction
Algorithms in Computational Biology11Department of Mathematics & Computer Science Algorithms in Computational Biology Building Phylogenetic Trees.
Phylogeny Ch. 7 & 8.
Phylogenetic trees Sushmita Roy BMI/CS 576 Sep 23 rd, 2014.
Applied Bioinformatics Week 8 Jens Allmer. Theory I.
Distance-Based Approaches to Inferring Phylogenetic Trees BMI/CS 576 Colin Dewey Fall 2010.
Distance-based methods for phylogenetic tree reconstruction Colin Dewey BMI/CS 576 Fall 2015.
Fitch-Margoliash Algorithm 1.From the distance matrix find the closest pair, e.g., A & B 2.Treat the rest of the sequences as a single composite sequence.
CSCE555 Bioinformatics Lecture 13 Phylogenetics II Meeting: MW 4:00PM-5:15PM SWGN2A21 Instructor: Dr. Jianjun Hu Course page:
Phylogenetic trees. 2 Phylogeny is the inference of evolutionary relationships. Traditionally, phylogeny relied on the comparison of morphological features.
Taking the Bite (Byte?) Out of Phylogeny Jennifer Galovich Lucy Kluckhohn Jones Holly Pinkart.
Lecture 14 CS5661 Neighbor Joining Generates unrooted tree, allowing for unequal branches Given: Distance matrix for sequences Steps: Repeat 1-3 till all.
394C, Spring 2012 Jan 23, 2012 Tandy Warnow.
Distance based phylogenetics
dij(T) - the length of a path between leaves i and j
Multiple Sequence Alignment
The Tree of Life From Ernst Haeckel, 1891.
Phylogenetic Trees.
Multiple Genome Rearrangement
Lecture 7 – Algorithmic Approaches
Phylogeny.
Presentation transcript:

Tutorial 5 Phylogenetic Trees

Agenda How to construct a tree using Neighbor Joining algorithm Phylogeny.fr tool Cool story of the day: Horizontal gene transfer

Neighbor Joining vs. UPGMA Assumption: Divergence of sequences is assumed to occur at a constant rate Distance to root is equal Constructs an unrooted guide tree from a distance matrix We do not assume constant rate of evolution

Unrooted guide tree 4

Neighbor Joining Algorithm 2 matrices Calculate all pairwise distances. Find 2 nodes i and j, such that the relative distance between i and j is minimal. Remove the rows and columns of i and j Add a new row and column k (the parent of i and j), and compute the distance from k to any other remaining node. Continue until two nodes remain – connect them with an edge.

Step 1. Calculate all pairwise distances A, B, C, D and E are tree nodes. Each character represents a sequence. How can we measure distance between sequences? E D C B A 41 39 22 43 20 18 10

Step 1. Calculate all pairwise distances Distance between sequences Euclidean Distance: Given a multiple sequence alignment, calculate the square root of the sum of the score at every position between two sequences. The score increases as the dissimilarity between residues increases.

Step 1. Calculate all pairwise distances The distance between each pair of sequences is based on multiple sequence alignment Multiple sequence alignment a: A T G G C b: A A G C C c: C A G C C d: G G G C G e: A T G C C 𝒂 𝟏 𝒂 𝟐 𝒂 𝟑 𝒂 𝟒 𝒂 𝟓 A T G G C A A G C C 𝒃 𝟏 𝒃 𝟐 𝒃 𝟑 𝒃 𝟒 𝒃 𝟓

Step 2. Two nodes with minimal relative distance If we assume constant evolution rate we may construct a wrong tree. Closest leaves aren’t necessarily neighbors: i and j are neighbors, but (dij = 13) > (djk = 12)

Step 2. Two nodes with minimal relative distance Find a pair of leaves that are close to each other, but far from other leaves. This is called “relative distance”. Negative values As the average distance from the common ancestor to the rest of the nodes increases, Mij has a lower value. Select pair that produce lowest value Reevaluate M with every iteration

Step 2. Two nodes with minimal relative distance Relative distance between i and j Distance between i and j (from the distance table) Distance between i and all other nodes Number of leaves (=sequences) left in the tree

Step 2. Two nodes with minimal relative distance Distances matrix: E D C B A 41 39 22 43 20 18 10 A B C D E

Step 2. Two nodes with minimal relative distance Distances matrix: E D C B A 41 39 22 43 20 18 10 𝑟 𝐴 =47 𝑟 𝐵 =49 𝑟 𝐶 =39.3 𝑟 𝐷 =36 𝑟 𝐸 =38

Step 2. Two nodes with minimal relative distance The relative distance table: E D C B A -44 -47.3 -74 - -57.3 -64 A,B is the pair with the minimal Mi,j distance. The Mij Table is used only to choose the closest pairs (lowest value) and not for calculating the distances

Steps 3+4. Remove i, j and add k to the matrix The distance from k to any other leaf m can be computed as: Dkm = (Dim + Djm – Dij)/2 Compress i and j into k, iterate algorithm for rest of tree

Steps 3+4. Remove i, j and add k to the matrix Now we’ll calculate the distance from X to all other nodes: E D C k 31 29 20 18 10 A B C D E K

Steps 5. Continue till 2 nodes remain The final tree: B A 12 10 20 5 6 4 9 K What is missing? E Y Z C D

Phylogeny.fr

One click mode

One click mode

One click mode Multiple sequence alignment (MSA) is a basic step in phylogenetic tree construction and is the base for the distance matrix

“A la carte” mode

“On-click” default settings

Horizontal gene transfer Cool Story of the day Horizontal gene transfer

Is horizontal gene transfer possible?

Viruses

Horizontal gene transfer in Bacteria Horizontal gene transfer is the primary reason for bacterial antibiotic resistance and plays an important role in the evolution of bacteria. Horizontal gene transfer is very abundant in bacteria, it is hard to talk about a bacteria’s genome, but more of the genome of a “society of bacteria”. http://en.wikipedia.org/wiki/Horizontal_gene_transfer

Sea slug The sea slug Elysia chlorotica incorporates chloroplasts from the algae that it eats into its body. Photosynthesis continues for up to 12 months using genes within the chloroplast, which are directed by algal nuclear genes that were transferred to the nuclei of the slug. http://en.wikipedia.org/wiki/Horizontal_gene_transfer

Until the full speciation… Bioinformatics/ David W.Mount p. 244