Linkage stuff Vibhav Gogate. A Review of the Genetic Model X1X1 X2X3Xi-1XiXi+1Y1Y1 Y2Y2 Y3Y3 Y i-1 YiYi Y i+1 X1X1 X2X3Xi-1XiXi+1S1S1 S2S2 S3S3 S i-1.

Slides:



Advertisements
Similar presentations
Linkage and Genetic Mapping
Advertisements

Planning breeding programs for impact
Tutorial #8 by Ma’ayan Fishelson. Computational Difficulties Algorithms that perform multipoint likelihood computations sum over all the possible ordered.
. Exact Inference in Bayesian Networks Lecture 9.
Tutorial #1 by Ma’ayan Fishelson
Gene Frequency and LINKAGE Gregory Kovriga & Alex Ratt.
METHODS FOR HAPLOTYPE RECONSTRUCTION
Tutorial #5 by Ma’ayan Fishelson. Input Format of Superlink There are 2 input files: –The locus file describes the loci being analyzed and parameters.
Tutorial #2 by Ma’ayan Fishelson. Crossing Over Sometimes in meiosis, homologous chromosomes exchange parts in a process called crossing-over. New combinations.
Genetic linkage analysis Dotan Schreiber According to a series of presentations by M. Fishelson.
Basics of Linkage Analysis
. Parametric and Non-Parametric analysis of complex diseases Lecture #6 Based on: Chapter 25 & 26 in Terwilliger and Ott’s Handbook of Human Genetic Linkage.
Linkage Analysis: An Introduction Pak Sham Twin Workshop 2001.
Statistical association of genotype and phenotype.
1 Bayesian Methods with Monte Carlo Markov Chains II Henry Horng-Shing Lu Institute of Statistics National Chiao Tung University
Tutorial #6 by Ma’ayan Fishelson Based on notes by Terry Speed.
1 How many genes? Mapping mouse traits, cont. Lecture 2B, Statistics 246 January 22, 2004.
Tutorial by Ma’ayan Fishelson Changes made by Anna Tzemach.
. Learning Bayesian networks Slides by Nir Friedman.
Parametric and Non-Parametric analysis of complex diseases Lecture #8
. Bayesian Networks For Genetic Linkage Analysis Lecture #7.
. Basic Model For Genetic Linkage Analysis Lecture #3 Prepared by Dan Geiger.
. Hidden Markov Models For Genetic Linkage Analysis Lecture #4 Prepared by Dan Geiger.
Introduction to Linkage Analysis March Stages of Genetic Mapping Are there genes influencing this trait? Epidemiological studies Where are those.
"Maximum Likelihood Haplotyping for General Pedigrees." Fishelson M., Dovgolevsky N. and Geiger D. Human Heredity, 2005.
CASE STUDY: Genetic Linkage Analysis via Bayesian Networks
Mapping Basics MUPGRET Workshop June 18, Randomly Intermated P1 x P2  F1  SELF F …… One seed from each used for next generation.
Reconstructing Genealogies: a Bayesian approach Dario Gasbarra Matti Pirinen Mikko Sillanpää Elja Arjas Department of Mathematics and Statistics
Tutorial #5 by Ma’ayan Fishelson Changes made by Anna Tzemach.
Tutorial #5 by Ma’ayan Fishelson
General Explanation There are 2 input files –The locus file describes the loci being analyzed and parameters for the different analyzing programs. –The.
Image Analysis and Markov Random Fields (MRFs) Quanren Xiong.
Lecture 5: Segregation Analysis I Date: 9/10/02  Counting number of genotypes, mating types  Segregation analysis: dominant, codominant, estimating segregation.
. Basic Model For Genetic Linkage Analysis Lecture #5 Prepared by Dan Geiger.
Quantitative Trait Loci, QTL An introduction to quantitative genetics and common methods for mapping of loci underlying continuous traits:
Genetic Mapping Oregon Wolfe Barley Map (Szucs et al., The Plant Genome 2, )
Non-Mendelian Genetics
Introduction to Linkage Analysis Pak Sham Twin Workshop 2003.
National Taiwan University Department of Computer Science and Information Engineering Pattern Identification in a Haplotype Block * Kun-Mao Chao Department.
Lecture 19: Association Studies II Date: 10/29/02  Finish case-control  TDT  Relative Risk.
Experimental Design and Data Structure Supplement to Lecture 8 Fall
Quantitative Genetics. Continuous phenotypic variation within populations- not discrete characters Phenotypic variation due to both genetic and environmental.
Complex Traits Most neurobehavioral traits are complex Multifactorial
Quantitative Genetics
Lecture 4: Statistics Review II Date: 9/5/02  Hypothesis tests: power  Estimation: likelihood, moment estimation, least square  Statistical properties.
Estimating Genealogies from Marker Data Dario Gasbarra Matti Pirinen Mikko Sillanpää Elja Arjas Biometry Group Department of Mathematics and Statistics.
Markov Chain Monte Carlo Hadas Barkay Anat Hashavit.
Lecture 13: Linkage Analysis VI Date: 10/08/02  Complex models  Pedigrees  Elston-Stewart Algorithm  Lander-Green Algorithm.
Lecture 12: Linkage Analysis V Date: 10/03/02  Least squares  An EM algorithm  Simulated distribution  Marker coverage and density.
Tutorial #10 by Ma’ayan Fishelson. Classical Method of Linkage Analysis The classical method was parametric linkage analysis  the Lod-score method. This.
Lecture 15: Linkage Analysis VII
Lecture 3: Statistics Review I Date: 9/3/02  Distributions  Likelihood  Hypothesis tests.
Errors in Genetic Data Gonçalo Abecasis. Errors in Genetic Data Pedigree Errors Genotyping Errors Phenotyping Errors.
Practical With Merlin Gonçalo Abecasis. MERLIN Website Reference FAQ Source.
. Basic Model For Genetic Linkage Analysis Prepared by Dan Geiger.
Ch. 10.4: Meiosis & Mendel’s Principles Objectives: 1.Summarize the chromosome theory of inheritance. 2.Explain how genetic linkage provides exceptions.
Fast Elimination of Redundant Linear Equations and Reconstruction of Recombination-free Mendelian Inheritance on a Pedigree Authors: Lan Liu & Tao Jiang,
Association Mapping in Families Gonçalo Abecasis University of Oxford.
Genetic Algorithm. Outline Motivation Genetic algorithms An illustrative example Hypothesis space search.
Lecture 17: Model-Free Linkage Analysis Date: 10/17/02  IBD and IBS  IBD and linkage  Fully Informative Sib Pair Analysis  Sib Pair Analysis with Missing.
Gonçalo Abecasis and Janis Wigginton University of Michigan, Ann Arbor
Recombination (Crossing Over)
Error Checking for Linkage Analyses
Basic Model For Genetic Linkage Analysis Lecture #3
Attention-Deficit/Hyperactivity Disorder in a Population Isolate: Linkage to Loci at 4q13.2, 5q33.3, 11q22, and 17p11  Mauricio Arcos-Burgos, F. Xavier.
Lecture 9: QTL Mapping II: Outbred Populations
Linkage Analysis Problems
Claus Skaanning Jensen, Augustine Kong 
Genetic linkage analysis
Presentation transcript:

Linkage stuff Vibhav Gogate

A Review of the Genetic Model X1X1 X2X3Xi-1XiXi+1Y1Y1 Y2Y2 Y3Y3 Y i-1 YiYi Y i+1 X1X1 X2X3Xi-1XiXi+1S1S1 S2S2 S3S3 S i-1 SiSi S i+1 All except yellow nodes Our View E A Thompson et al’s view

A few other notation Divide the S variables S i,j denotes the indicator in meiosis i at location j. S i,j = 0 if DNA at meiosis i locus j is parent’s maternal DNA S i,j =1 if DNA at meiosis i locus j is parent’s paternal DNA S.,j = {S i,j | i=1,..,m} S i,. = {S i,j | j=1,..,l} Assuming that there are m meiosis and l locations.

More on S S 23m L 21f L 21m L 23m X 21 S 23f L 22f L 22m L 23f X 22 X 23 The variables in the circle are S.,2 i.e. the set of variables indicating meiosis at locus 2.

Gibbs sampling: Review Generate T samples {x t } from P(X|e): t=1 x 1 = {x 1 1,x 1 2,…x 1 k } t=2 x 2 = {x 2 1,x 2 2,…x 2 k } … After sampling, average: X1 X4 X8 X5 X2 X3 X9 X7 X6

Gibbs Properties: Review Good: Gibbs sampling is guaranteed to converge to P(X|e) as long as P(X|e) is ergodic: Shortcoming: Hard to estimate how many samples is enough Variance is too big in high- dimensions Not guaranteed to converge to P(X|e) with deterministic information

Rao-Blackwellisation (RB) (Casella & Robert, 1996) Rao-Blackwellisation provides salvation in some cases: Partition X into C and Z, such that we can compute P(c|e) and P(Z|c,e) efficiently. Sample from C and sum out Z (Rao- Blackwellisation). Rao-Blackwellised estimate:

Gibbs sampling with RB on Linkage (E A Thompson et al.) Two versions L-sampler Locus Sampler RB set is chosen from S.,j M-sampler Meiosis sampler RB set is chosen from S i,.

L-sampler A single locus is selected and inheritance indicators at the locus are updated based on the genotype data at all loci and on the current realization of inheritance indicators at all loci other than j.

L-sampler L-sampler can be implemented on any pedigree on which single-locus peeling is feasible Provided each inter-locus recombination fraction is strictly positive, the sampler is clearly irreducible. However, if the loci are tightly linked, mixing performance will be poor.

M-sampler At each iteration a single meiosis is selected and inheritance indicators for that meiosis are updated conditional on the genotype data at all loci and the current realization of inheritance indicators for all other meioses

Other Advances Use of Metropolis Hastings step Restart Sequential Imputation

The Actual Bayesnet output by Superlink

The Variables output by Superlink Genetic Loci. For each individual i and locus j, we denote two random variables G i,jp, G i,jm whose values are the specific alleles at locus j in individual i's paternal and maternal haplotypes respectively. Marker Phenotypes. For each individual i and marker locus j, a random variable P i,j whose value is the specific unordered pair of alleles measured at locus j of individual i. Disease Phenotypes. For each individual i, a binary random variable P i whose values are affected or unaffected. Selector Variables. For each individual i and marker locus j, two binary random variables S i,jp and S i,jm, the values of which are determined as follows. If a denotes i's father and b denotes i's mother, then S i,jp = 0 if G i,jp = G a,jp S i,jp =1 if G i,jp = G a,jm S i,jm is dened in a similar way, with b replacing a.

LOD SCORE

SampleSearch to compute LOD-SCORE (1) Compute P(e|θ 1 ) using SampleSearch+Importance Sampling (2) Compute P(e|θ=0.5) using SampleSearch+Importance Sampling Computing (1) and (2) is same as computing the probability of evidence.

SampleSearch-LB SampleSearch-LB computes a lower bound on the probability of evidence (i.e. both the numerator and denominator) Use of Bounding the LOD score. If LOD score > 3 then the location is significant If we know that the lower bound on the LOD score is 3, then we have our location Unfortunately SampleSearch-LB is not enough as we need an upper bound on the denominator Use SampleSearch in conjunction with Bozhena’s bounding techniques to upper bound the denominator.