Likelihood methods Given a particular model of evolution, we can estimate phylogenies using maximum likelihood.

Slides:



Advertisements
Similar presentations
Maximum Likelihood:Phylogeny Estimation Neelima Lingareddy.
Advertisements

Phylogenetic Tree A Phylogeny (Phylogenetic tree) or Evolutionary tree represents the evolutionary relationships among a set of organisms or groups of.
Bioinformatics Phylogenetic analysis and sequence alignment The concept of evolutionary tree Types of phylogenetic trees Measurements of genetic distances.
Introduction to Phylogenies
Phylogenetic Trees Lecture 4
1 General Phylogenetics Points that will be covered in this presentation Tree TerminologyTree Terminology General Points About Phylogenetic TreesGeneral.
Phylogenetic Trees - I.
Chapter 20 Cladograms.
Maximum Likelihood. Likelihood The likelihood is the probability of the data given the model.
Molecular Evolution Revised 29/12/06
Tree Reconstruction.
BIOE 109 Summer 2009 Lecture 4- Part II Phylogenetic Inference.
. Phylogeny II : Parsimony, ML, SEMPHY. Phylogenetic Tree u Topology: bifurcating Leaves - 1…N Internal nodes N+1…2N-2 leaf branch internal node.
Maximum Likelihood. The likelihood function is the simultaneous density of the observation, as a function of the model parameters. L(  ) = Pr(Data| 
Phylogenetic Trees Presenter: Michael Tung
CENTER FOR BIOLOGICAL SEQUENCE ANALYSIS Probabilistic modeling and molecular phylogeny Anders Gorm Pedersen Molecular Evolution Group Center for Biological.
Maximum Likelihood Flips usage of probability function A typical calculation: P(h|n,p) = C(h, n) * p h * (1-p) (n-h) The implied question: Given p of success.
Phylogenetic Estimation using Maximum Likelihood By: Jimin Zhu Xin Gong Xin Gong Sravanti polsani Sravanti polsani Rama sharma Rama sharma Shlomit Klopman.
Probabilistic Approaches to Phylogeny Wouter Van Gool & Thomas Jellema.
CENTER FOR BIOLOGICAL SEQUENCE ANALYSIS Probabilistic modeling and molecular phylogeny Anders Gorm Pedersen Molecular Evolution Group Center for Biological.
Phylogenetic Shadowing Daniel L. Ong. March 9, 2005RUGS, UC Berkeley2 Abstract The human genome contains about 3 billion base pairs! Algorithms to analyze.
Classification and phylogeny
Lecture 13 – Performance of Methods Folks often use the term “reliability” without a very clear definition of what it is. Methods of assessing performance.
Building Phylogenies Parsimony 1. Methods Distance-based Parsimony Maximum likelihood.
PhyloSub Jiao et. al. BMC Bioinformatics 2014, 15:35.
CENTER FOR BIOLOGICAL SEQUENCE ANALYSIS Probabilistic modeling and molecular phylogeny Anders Gorm Pedersen Molecular Evolution Group Center for Biological.
Maximum Likelihood Molecular Evolution. Maximum Likelihood The likelihood function is the simultaneous density of the observation, as a function of the.
Parsimony methods the evolutionary tree to be preferred involves ‘the minimum amount of evolution’ Edwards & Cavalli-Sforza Reconstruct all evolutionary.
Likelihood probability of observing the data given a model with certain parameters Maximum Likelihood Estimation (MLE) –find the parameter combination.
Molecular phylogenetics
Molecular evidence for endosymbiosis Perform blastp to investigate sequence similarity among domains of life Found yeast nuclear genes exhibit more sequence.
Bioinformatics 2011 Molecular Evolution Revised 29/12/06.
Why species are not independent data points and what to do about it: correlation on independent contrasts.
Baysian Prob.. Example Red box has 2 apples and 6 oranges Blue box has 3 apples and 1 orange Pick a box, randomly select a fruit, and put it back Joint.
Introduction to Phylogenetic Trees
Phylogenetic Trees  Importance of phylogenetic trees  What is the phylogenetic analysis  Example of cladistics  Assumptions in cladistics  Frequently.
PHYLOGENETIC TREES. A phylogeny, or species/evolutionary tree, represents the evolutionary relationships among a set of organisms or groups of organisms,
Introduction to Phylogenetics
Reading Phylogenetic Trees
MOLECULAR PHYLOGENETICS Four main families of molecular phylogenetic methods :  Parsimony  Distance methods  Maximum likelihood methods  Bayesian methods.
Calculating branch lengths from distances. ABC A B C----- a b c.
More statistical stuff CS 394C Feb 6, Today Review of material from Jan 31 Calculating pattern probabilities Why maximum parsimony and UPGMA are.
Gene tree discordance and multi-species coalescent models Noah Rosenberg December 21, 2007 James Degnan Randa Tao David Bryant Mike DeGiorgio.
Statistical stuff: models, methods, and performance issues CS 394C September 16, 2013.
Maximum Likelihood Given competing explanations for a particular observation, which explanation should we choose? Maximum likelihood methodologies suggest.
Phylogeny Ch. 7 & 8.
Advanced Algorithms and Models for Computational Biology -- a machine learning approach Molecular Ecolution: Phylogenetic trees Eric Xing Lecture 21, April.
Selecting Genomes for Reconstruction of Ancestral Genomes Louxin Zhang Department of Mathematics National University of Singapore.
Cladograms. Evolutionary tree used to  Test hypotheses about evolution  Learn about the characteristics of extinct species and ancestral lineages 
CENTER FOR BIOLOGICAL SEQUENCE ANALYSIS Probabilistic modeling and molecular phylogeny Anders Gorm Pedersen Molecular Evolution Group Center for Biological.
Probabilistic Approaches to Phylogenies BMI/CS 576 Sushmita Roy Oct 2 nd, 2014.
Phylogeny.
Bioinf.cs.auckland.ac.nz Juin 2008 Uncorrelated and Autocorrelated relaxed phylogenetics Michaël Defoin-Platel and Alexei Drummond.
Statistical stuff: models, methods, and performance issues CS 394C September 3, 2009.
Building Phylogenies Maximum Likelihood. Methods Distance-based Parsimony Maximum likelihood.
Building Phylogenies. Phylogenetic (evolutionary) trees Human Gorilla Chimp Gibbon Orangutan Describe evolutionary relationships between species Cannot.
An Algorithm for Computing the Gene Tree Probability under the Multispecies Coalescent and its Application in the Inference of Population Tree Yufeng Wu.
Phylogenetic basis of systematics
Distance based phylogenetics
Multiple Alignment and Phylogenetic Trees
Endeavour to reconstruct the characters of each hypothetical ancestor.
Recitation 5 2/4/09 ML in Phylogeny
Figure 17. 1: An Example of a One-Factor Spot Rate Process Figure 17.1: An Example of a One-Factor Spot Rate Process. Actual Probabilities.
Modern Evolutionary Classification 18-2
Molecular Clocks Rose Hoberman.
Reading Phylogenetic Trees
Evolutionary Trees.
Phylogeny and the Tree of Life
Phylogenetic Trees Vocab
Phylogenetic analysis of AquK2P.
Presentation transcript:

Likelihood methods Given a particular model of evolution, we can estimate phylogenies using maximum likelihood

Likelihood with a coin L = Prob (HHTTHTHHTHHTTT | p) = p p (1-p) (1-p) p (1-p) p p (1-p) p p (1-p) (1-p) (1-p) HHTTHTHHTHHTTT data (D) likelihood = p 5 (1-p) 6

Likelihood with a coin likelihood curve p=0.4545…

Likelihood with a coin L = Prob (HHTTHTHHTHHTTT | p) = p 5 (1-p) 6 dL dp = 5p 4 (1-p) 6 – 6p 5 (1-p) 5  L maximal if 5p 4 (1-p) 6 – 6p 5 (1-p) 5 = 0  p = 5/11

Likelihood with a coin L = Prob (HHTTHTHHTHHTTT | p) = p 5 (1-p) 6 ln (L) = 5 ln(p) + 6 ln(1-p)  ln(L) maximal if  p = 5/ p (1-p) - = 0

Likelihood of a tree a tree topology and branch lengths an evolutionary model (sequence) data Given and assuming 1.evolution in different sites is independent 2.evolution in different lineages is independent

Likelihood of a tree L = Prob(D|T) = ∏ Prob(D i |T) i=1 m data at the i th site

Likelihood of a tree A A A A A C C C G t1t1 t2t2 t6t6 t8t8 t3t3 t7t7 t4t4 t5t5

Prob(D i |T) = ∑ ∑ ∑ ∑ Prob (A, C, C, C, G, x, y, z, w | T) x ancestor x can be A, C, T or G yzw likelihood of the observed data at site i

Likelihood of a tree Prob (A, C, C, C, G, x, y, z, w | T) = Prob(x) … y x z w A C C C G t1t1 t2t2 t6t6 t8t8 t3t3 t7t7 t4t4 t5t5

Likelihood of a tree Prob (A, C, C, C, G, x, y, z, w | T) = Prob(x) Prob (y|x, t 6 ) … y x z w A C C C G t1t1 t2t2 t6t6 t8t8 t3t3 t7t7 t4t4 t5t5

Likelihood of a tree Prob (A, C, C, C, G, x, y, z, w | T) = Prob(x) Prob (y|x, t 6 ) Prob (A|y, t 1 ) … y x z w A C C C G t1t1 t2t2 t6t6 t8t8 t3t3 t7t7 t4t4 t5t5

Likelihood of a tree Prob (A, C, C, C, G, x, y, z, w | T) = Prob(x) Prob (y|x, t 6 ) Prob (A|y, t 1 ) Prob (C|y, t 2 ) Prob (z|x, t 8 ) Prob (C|z, t 3 ) Prob (w|z, t 7 ) Prob (C|w, t 4 ) Prob (G|w, t 5 ) y x z w A C C C G t1t1 t2t2 t6t6 t8t8 t3t3 t7t7 t4t4 t5t5

Likelihood of a tree #tip species# interior nodes# scenarios Prob(D i |T) = ∑ ∑ ∑ ∑ Prob (A, C, C, C, G, x, y, z, w | T) xyzw