Extensions to Basic Coalescent Chapter 4, Part 1.

Slides:



Advertisements
Similar presentations
Discrete Random Variables and Probability Distributions
Advertisements

Chapter 3 Some Special Distributions Math 6203 Fall 2009 Instructor: Ayona Chatterjee.
Discrete Uniform Distribution
Sampling distributions of alleles under models of neutral evolution.
Coalescence with Mutations Towards incorporating greater realism Last time we discussed 2 idealized models – Infinite Alleles, Infinite Sites A realistic.
N-gene Coalescent Problems Probability of the 1 st success after waiting t, given a time-constant, a ~ p, of success 5/20/2015Comp 790– Continuous-Time.
Lecture 23: Introduction to Coalescence April 7, 2014.
Forward Genealogical Simulations Assumptions:1) Fixed population size 2) Fixed mating time Step #1:The mating process: For a fixed population size N, there.
Probability Densities
Review.
Discrete Random Variables and Probability Distributions
Statistical Inference Chapter 12/13. COMP 5340/6340 Statistical Inference2 Statistical Inference Given a sample of observations from a population, the.
Association Mapping of Complex Diseases with Ancestral Recombination Graphs: Models and Efficient Algorithms Yufeng Wu UC Davis RECOMB 2007.
Probability Distributions
March 2006Vineet Bafna CSE280b: Population Genetics Vineet Bafna/Pavel Pevzner
Continuous Coalescent Model
Dispersal models Continuous populations Isolation-by-distance Discrete populations Stepping-stone Island model.
2: Population genetics Break.
Salit Kark Department of Evolution, Systematics and Ecology The Silberman Institute of Life Sciences The Hebrew University of Jerusalem Conservation Biology.
G. Cowan Lectures on Statistical Data Analysis 1 Statistical Data Analysis: Lecture 8 1Probability, Bayes’ theorem, random variables, pdfs 2Functions of.
Probability theory 2011 Outline of lecture 7 The Poisson process  Definitions  Restarted Poisson processes  Conditioning in Poisson processes  Thinning.
Some standard univariate probability distributions
Probability theory 2011 Convergence concepts in probability theory  Definitions and relations between convergence concepts  Sufficient conditions for.
Some standard univariate probability distributions
Some Continuous Probability Distributions Asmaa Yaseen.
The Poisson Probability Distribution The Poisson probability distribution provides a good model for the probability distribution of the number of “rare.
CMPE 252A: Computer Networks Review Set:
Exponential Distribution & Poisson Process
McGraw-Hill/Irwin Copyright © 2007 by The McGraw-Hill Companies, Inc. All rights reserved. Discrete Random Variables Chapter 4.
Generalized Semi-Markov Processes (GSMP)
Modeling and Simulation CS 313
Extensions to Basic Coalescent Chapter 4, Part 2.
Phylogenetics and Coalescence Lab 9 October 24, 2012.
CPSC 531: Probability Review1 CPSC 531:Probability & Statistics: Review II Instructor: Anirban Mahanti Office: ICT 745
Lecture 19 Nov10, 2010 Discrete event simulation (Ross) discrete and continuous distributions computationally generating random variable following various.
Trees & Topologies Chapter 3, Part 1. Terminology Equivalence Classes – specific separation of a set of genes into disjoint sets covering the whole set.
McGraw-Hill/IrwinCopyright © 2009 by The McGraw-Hill Companies, Inc. All Rights Reserved. Chapter 5 Discrete Random Variables.
Models and their benefits. Models + Data 1. probability of data (statistics...) 2. probability of individual histories 3. hypothesis testing 4. parameter.
Getting Parameters from data Comp 790– Coalescence with Mutations1.
Coalescent Models for Genetic Demography
Generalized Semi- Markov Processes (GSMP). Summary Some Definitions The Poisson Process Properties of the Poisson Process  Interarrival times  Memoryless.
CHAPTER 5 SIGNAL SPACE ANALYSIS
Probability Refresher COMP5416 Advanced Network Technologies.
FINE SCALE MAPPING ANDREW MORRIS Wellcome Trust Centre for Human Genetics March 7, 2003.
Modeling and simulation of systems Introduction to queuing theory Slovak University of Technology Faculty of Material Science and Technology in Trnava.
By Mireya Diaz Department of Epidemiology and Biostatistics for EECS 458.
Coalescent theory CSE280Vineet Bafna Expectation, and deviance Statements such as the ones below can be made only if we have an underlying model that.
SS r SS r This model characterizes how S(t) is changing.
Copyright © 2011 by The McGraw-Hill Companies, Inc. All rights reserved. McGraw-Hill/Irwin Chapter 5 Discrete Random Variables.
G. Cowan Lectures on Statistical Data Analysis Lecture 9 page 1 Statistical Data Analysis: Lecture 9 1Probability, Bayes’ theorem 2Random variables and.
1 Lecture 4 Probability Concepts. 2 Section 4.1 Probability Basics.
Probability Generating Functions Suppose a RV X can take on values in the set of non-negative integers: {0, 1, 2, …}. Definition: The probability generating.
Fixed Parameters: Population Structure, Mutation, Selection, Recombination,... Reproductive Structure Genealogies of non-sequenced data Genealogies of.
A Little Intro to Statistics What’s the chance of rolling a 6 on a dice? 1/6 What’s the chance of rolling a 3 on a dice? 1/6 Rolling 11 times and not getting.
Modelling evolution Gil McVean Department of Statistics TC A G.
CHAPTER 4 ESTIMATES OF MEAN AND ERRORS. 4.1 METHOD OF LEAST SQUARES I n Chapter 2 we defined the mean  of the parent distribution and noted that the.
Chapter 4 Discrete Random Variables and Probability Distributions
Nonlinear function minimization (review). Newton’s minimization method Ecological detective p. 267 Isaac Newton We want to find the minimum value of f(x)
Inferences on human demographic history using computational Population Genetic models Gabor T. Marth Department of Biology Boston College Chestnut Hill,
Trees & Topologies Chapter 3, Part 2. A simple lineage Consider a given gene of sample size n. How long does it take before this gene coalesces with another.
Ch3.5 Hypergeometric Distribution
An Algorithm for Computing the Gene Tree Probability under the Multispecies Coalescent and its Application in the Inference of Population Tree Yufeng Wu.
The Exponential and Gamma Distributions
Lecture 7 Effective population size Bottlenecks Coalescence theory basics Sonja Kujala
Chapter 5 Statistical Models in Simulation
Multinomial Distribution
The coalescent with recombination (Chapter 5, Part 1)
Trees & Topologies Chapter 3, Part 2
Trees & Topologies Chapter 3, Part 2
Presentation transcript:

Extensions to Basic Coalescent Chapter 4, Part 1

Extension 1 One of the assumptions of basic coalescent (Wright-Fisher) model: Population size is constant We will relax this assumption 2/26/2009COMP 790-Extensions to Basic Coalescent2

Outline Intuition behind extension Formal definition of the extended model Compare extended model to basic model for 2 different population change functions – Exponential growth (more emphasis on this) – Population bottlenecks Effective population size 2/26/2009COMP 790-Extensions to Basic Coalescent3

Intuition We will only consider deterministic population changes Population size at time t is given by N(t), a function of t only N(0) = N We assume N(t) is given in terms of continuous time (in units of 2N generations) and N(t) need not to be an integer 2/26/2009COMP 790-Extensions to Basic Coalescent4

Intuition Let p=probability by which two genes find a common ancestor Wright Fisher model p = 1/2N Extended model p(t) = 1/2N(t) E.g. when N(t) < N (declining population size) Probability of a coalescence event increases and a MRCA is found more rapidly than if N(t) is constant 2/26/2009COMP 790-Extensions to Basic Coalescent5

Intuition If p(t) is smaller than p(0) by factor if two (for example) then time should be stretched locally by a factor if two to accommodate this 2/26/2009COMP 790-Extensions to Basic Coalescent6

Intuition 2/26/2009COMP 790-Extensions to Basic Coalescent7 Time in basic coalescent Time in extended model Each of the intervals between dashed lines represents 2N generations

Formulation 2/26/2009COMP 790-Extensions to Basic Coalescent8 Accumulated coalescent rate over time measured relative to the rate at time t=0 where

Formulation Let T 2,… T n be the waiting times while there are 2,…,n ancestors of the sample and let V k = T n + … +T k be the accumulated waiting times from there are n genes until there are k-1 ancestors The distribution of T k conditiona on V k+1 is 2/26/2009COMP 790-Extensions to Basic Coalescent9

Formulation T k * : Waiting times in basic coalescent T k : Waiting times in extended model Algorithm 1.Simulate T 2 *, … T n * according to the basiccoalescent, where T k * is exponentially distributed with parameter C(k,2). Denote the simulated values by t k * 2.Solve 3. The values t k = v k- v k+1 are an outcome of the process, T 2, …,T n 2/26/2009 COMP 790-Extensions to Basic Coalescent10

Exponential growth Now lets have a look at specific population size change function: exponential growth Question: This is a declining function. How come this can be a growth? 2/26/2009COMP 790-Extensions to Basic Coalescent11

Exponential Growth For this specific population change function we can derive the following: Using the algorithm: 2/26/2009COMP 790-Extensions to Basic Coalescent12

Characterizations of Exponential Growth Now lets have a look at various characterizations of this population growth Characterization 1 – Waiting times, T 2, …,T n are no longer independent of each other as in basic coalescent but negatively correlated – If one of them is large the others are more likely to be small 2/26/2009COMP 790-Extensions to Basic Coalescent13

Characterizations of Exponential Growth 2/26/2009COMP 790-Extensions to Basic Coalescent14

Characterizations of Exponential Growth Characterization 2: Genealogy 2/26/2009COMP 790-Extensions to Basic Coalescent15 Characterization 2: Genealogy Basic coalescentExponential growthBasic coalescentExponential growth

Characterizations of Exponential Growth With high levels of exponential growth, tree becomes almost star shaped. 2/26/2009COMP 790-Extensions to Basic Coalescent16

Characterizations of Exponential Growth 2/26/2009COMP 790-Extensions to Basic Coalescent17

Characterizations of Exponential Growth Pairwise distances between all pairs of sequences. 2/26/2009COMP 790-Extensions to Basic Coalescent18 Basic coalescent (multimodal) Exponential growth (unimodal)

Characterizations of Exponential Growth Frequency spectrum of mutants 2/26/2009COMP 790-Extensions to Basic Coalescent19

Characterizations of Exponential Growth Percentage of contribution of kth waiting time to the mean and variance of total waiting time 2/26/2009COMP 790-Extensions to Basic Coalescent20

Population Bottlenecks Now we move on to the next type of population size change function: bottlenecks A way to model ice age 2/26/2009COMP 790-Extensions to Basic Coalescent21

Population Bottlenecks 2/26/2009COMP 790-Extensions to Basic Coalescent22 4 parameters. Strength of the bottleneck is determined by its length (tb) and severity(f)

Effective Population Size 2/26/2009COMP 790-Extensions to Basic Coalescent23 We defined effective population size in very first lectures as:

Effective Population Size 2/26/2009COMP 790-Extensions to Basic Coalescent24

Next Time Relax another assumption – > Coalescent with population structure 2/26/2009COMP 790-Extensions to Basic Coalescent25