Phylogenetics-2 Marek Kimmel (Statistics, Rice) 713 348 5255

Slides:



Advertisements
Similar presentations
Parsimony Genome 559: Introduction to Statistical and Computational Genomics Elhanan Borenstein.
Advertisements

Phylogenetic Tree A Phylogeny (Phylogenetic tree) or Evolutionary tree represents the evolutionary relationships among a set of organisms or groups of.
PHYLOGENETIC TREES Bulent Moller CSE March 2004.
. 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.
The Evolutionary Basis of Bioinformatics: An Introduction to Phylogenetics > Sequence 1 GAGGTAGTAATTAGATCCGAAA… > Sequence.
Phylogenetics - Distance-Based Methods CIS 667 March 11, 2204.
Phylogenetic reconstruction
Phylogenetic trees Sushmita Roy BMI/CS 576 Sep 23 rd, 2014.
Molecular Evolution Revised 29/12/06
© Wiley Publishing All Rights Reserved. Phylogeny.
. Computational Genomics 5a Distance Based Trees Reconstruction (cont.) Modified by Benny Chor, from slides by Shlomo Moran and Ydo Wexler (IIT)
. Phylogeny II : Parsimony, ML, SEMPHY. Phylogenetic Tree u Topology: bifurcating Leaves - 1…N Internal nodes N+1…2N-2 leaf branch internal node.
UPGMA and FM are distance based methods. UPGMA enforces the Molecular Clock Assumption. FM (Fitch-Margoliash) relieves that restriction, but still enforces.
Bioinformatics Algorithms and Data Structures
. Distance-Based Phylogenetic Reconstruction ( part II ) Tutorial #11 © Ilan Gronau.
Distance methods. UPGMA: similar to hierarchical clustering but not additive Neighbor-joining: more sophisticated and additive What is additivity?
In addition to maximum parsimony (MP) and likelihood methods, pairwise distance methods form the third large group of methods to infer evolutionary trees.
5 - 1 Chap 5 The Evolution Trees Evolutionary Tree.
. Multiple Sequence Alignment Tutorial #4 © Ilan Gronau.
BME 130 – Genomes Lecture 26 Molecular phylogenies I.
CISC667, F05, Lec15, Liao1 CISC 667 Intro to Bioinformatics (Fall 2005) Phylogenetic Trees (II) Distance-based methods.
. Class 9: Phylogenetic Trees. The Tree of Life D’après Ernst Haeckel, 1891.
Lecture 24 Inferring molecular phylogeny Distance methods
Chapter 5 The Evolution Trees.
. Comput. Genomics, Lecture 5b Character Based Methods for Reconstructing Phylogenetic Trees: Maximum Parsimony Based on presentations by Dan Geiger, Shlomo.
Distance-Based Phylogenetic Reconstruction Tutorial #8 © Ilan Gronau, edited by Itai Sharon.
Building Phylogenies Distance-Based Methods. Methods Distance-based Parsimony Maximum likelihood.
. Class 9: Phylogenetic Trees. The Tree of Life D’après Ernst Haeckel, 1891.
Phylogenetic Trees Lecture 2
. Multiple Sequence Alignment Tutorial #4 © Ilan Gronau.
Phylogenetic trees Tutorial 6. Distance based methods UPGMA Neighbor Joining Tools Mega phylogeny.fr DrewTree Phylogenetic Trees.
Phylogenetic trees Sushmita Roy BMI/CS 576
9/1/ Ultrametric phylogenies By Sivan Yogev Based on Chapter 11 from “Inferring Phylogenies” by J. Felsenstein.
Phylogenetic analyses Kirsi Kostamo. The aim: To construct a visual representation (a tree) to describe the assumed evolution occurring between and among.
P HYLOGENETIC T REE. OVERVIEW Phylogenetic Tree Phylogeny Applications Types of phylogenetic tree Terminology Data used to build a tree Building phylogenetic.
Molecular evidence for endosymbiosis Perform blastp to investigate sequence similarity among domains of life Found yeast nuclear genes exhibit more sequence.
Phylogenetics Alexei Drummond. CS Friday quiz: How many rooted binary trees having 20 labeled terminal nodes are there? (A) (B)
1 Dan Graur Molecular Phylogenetics Molecular phylogenetic approaches: 1. distance-matrix (based on distance measures) 2. character-state.
PHYLOGENETIC TREES Dwyane George February 24,
Phylogenetic Analysis. General comments on phylogenetics Phylogenetics is the branch of biology that deals with evolutionary relatedness Uses some measure.
BINF6201/8201 Molecular phylogenetic methods
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  Importance of phylogenetic trees  What is the phylogenetic analysis  Example of cladistics  Assumptions in cladistics  Frequently.
Building phylogenetic trees. Contents Phylogeny Phylogenetic trees How to make a phylogenetic tree from pairwise distances  UPGMA method (+ an example)
Introduction to Phylogenetics
 Rooted tree and binary tree  Theorem 5.19: A full binary tree with t leaves contains i=t-1 internal vertices.
5.5.2 M inimum spanning trees  Definition 24: A minimum spanning tree in a connected weighted graph is a spanning tree that has the smallest possible.
Ch.6 Phylogenetic Trees 2 Contents Phylogenetic Trees Character State Matrix Perfect Phylogeny Binary Character States Two Characters Distance Matrix.
5.5.3 Rooted tree and binary tree  Definition 25: A directed graph is a directed tree if the graph is a tree in the underlying undirected graph.  Definition.
Gene tree discordance and multi-species coalescent models Noah Rosenberg December 21, 2007 James Degnan Randa Tao David Bryant Mike DeGiorgio.
1 Population Genetics Basics. 2 Terminology review Allele Locus Diploid SNP.
Comp. Genomics Recitation 8 Phylogeny. Outline Phylogeny: Distance based Probabilistic Parsimony.
Phylogeny Ch. 7 & 8.
Phylogenetic trees Sushmita Roy BMI/CS 576 Sep 23 rd, 2014.
Phylogenetics.
1 CAP5510 – Bioinformatics Phylogeny Tamer Kahveci CISE Department University of Florida.
598AGB Basics Tandy Warnow. DNA Sequence Evolution AAGACTT TGGACTTAAGGCCT -3 mil yrs -2 mil yrs -1 mil yrs today AGGGCATTAGCCCTAGCACTT AAGGCCTTGGACTT.
Choosing the most parsimonious tree
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.
CSCE555 Bioinformatics Lecture 13 Phylogenetics II Meeting: MW 4:00PM-5:15PM SWGN2A21 Instructor: Dr. Jianjun Hu Course page:
5.6 Prefix codes and optimal tree Definition 31: Codes with this property which the bit string for a letter never occurs as the first part of the bit string.
1 Schnyder’s Method. 2 Motivation Given a planar graph, we want to embed it in a grid We want the grid to be relatively small And we want an efficient.
Phylogenetic trees. 2 Phylogeny is the inference of evolutionary relationships. Traditionally, phylogeny relied on the comparison of morphological features.
The Evolution Trees (Part I)
The Tree of Life From Ernst Haeckel, 1891.
Phylogenetic Trees.
Phylogeny.
Presentation transcript:

Phylogenetics-2 Marek Kimmel (Statistics, Rice)

Outline Distance trees and ultrametric distances Existence of a tree given a set of ultrametric distances UPGMA method Neighbor Joining method Maximum Parsimony (independent reading)

Distance axioms 1.Nonnegativeness, d(x, y)  0. 2.Nondegeneracy, d(x, y)  0  x = y 3.Symmetry, d(x, y) = d(y, x) 4.Triangle property, d(x, y)  d(x, z) + d(z, y) For tree – derived distances: 5.Ultrametricity. For any three points, two distances are equal and the third is less than these two, e.g. d(x, y) < d(x, z) = d(z, y)

Ultrametricity For any 3-subtree, d(x, y) < d(x, z) = d(z, y) Distances: tree – derived  all triplets are ultrametric If all triplets ultrametric, do the distances uniquely define a tree?

Proof of tree existence Constructive proof, by induction, given set of nodes, with ultrametric distances. First step: Construct a tree with 2 species

m-step Suppose tree constructed for first m species. r = old root

m+1 - step Take x and y as in the previous slide and s m+1 Suppose d(s m+1, x) = d(s m+1, y) (other cases handled similarly). Consequently, d(x, y) < d(s m+1, x) = d(s m+1, y). r = old root new root

Induction Choose x and y and define These distances good for x and y, now check for any z

Remarks Similar proofs for the other two cases UPGMA method builds the same trees simpler. Not good for non-ultrametric distances, closest nodes do not have to be neighbors. Neighbor Joining method is a remedy (to be continued …).

Neighbor-joining distance Neighbor-joining “distance” is not a distance, but it satisfies the following theorem: Theorem. Suppose S is a set of species and d is a tree-derived distance on S obtained from an unrooted tree (so, not necessarily ultrametric). If x and y are such that  (x,y) are minimum, then x and y are neighbors.

Proof for N = 4 In a 4-tree, all leaves have neighbors General proof, see the book N.-J. Algorithm, see the book

Gene splitting versus population splitting Diagram showing that gene splitting (G) usually occurs earlier than population splitting (P) if the population is genetically polymorphic at time P. The evolutionary history of gene splitting resulting in the six alleles denoted a-f is shown in solid lines, and population splitting is shown in broken lines. After Nei (1987).