Changes between Initial Version and Version 1 of DeNovoVariationPipeline


Ignore:
Timestamp:
Sep 13, 2010 12:02:36 AM (14 years ago)
Author:
Morris Swertz
Comment:

--

Legend:

Unmodified
Added
Removed
Modified
  • DeNovoVariationPipeline

    v1 v1  
     1[[TOC()]]
     2
     3= Is discovery of ''de-novo'' mutations feasible in GvNL data? =
     4
     5Following the discussion of Yurii Aulchenko and Kai Ye, 2010.09.08 – 2010.09.12
     6
     7== PROBLEM ==
     8
     9When a ‘de-novo’ mutation occurs, we may see the following picture:
     10
     11Reads in one of the parents (r: reference. A: alternative variant)
     12{{{
     13rrrrrrrrrr
     14
     15rrrrrrrrrr
     16
     17rrrrrrrrrr
     18
     19rrrrrrrrrr
     20
     21rrrrrrrrrr
     22
     23rrrrrrrrrr
     24}}}
     25
     26Other parent reads
     27
     28{{{
     29rrrrrrrrrr
     30
     31rrrrrrrrrr
     32
     33rrrrrrrrrr
     34
     35rrrrrrrrrr
     36
     37rrrrrrrrrr
     38
     39rrrrrrrrrr
     40
     41rrrrrrrrrr
     42
     43}}}
     44
     45Reads in offspring
     46
     47{{{
     48rrrrrArrrr
     49
     50rrrrrArrrr
     51
     52rrrrrArrrr
     53
     54rrrrrArrrr
     55
     56rrrrrArrrr
     57
     58rrrrrrrrrr
     59
     60rrrrrrrrrr
     61
     62rrrrrrrrrr
     63
     64rrrrrrrrrr
     65
     66}}}
     67
     68The problem is that actually either of the parents can be a heterozygous carrier of “A”, and we have missed this allele just by chance (chance to miss it is estimated to be approximately ~1%). This means we will see above described scenario in tens of thousands of locations. Given expected number of ‘de novo’ mutations in a person is ~50, verification step will present a major problem.
     69
     70We see there may be two (potentially complementary) ways out with this problem.
     71
     72== (1) COVERAGE ==
     73
     74For few trios, increase coverage (potentially only in parents, or even one parent); this will decrease the chance that we miss a heterozygote. We did calculations of what coverage should be so we get chance of het missing becoming comparable to the mutation rate; e.g. we aim chance het missing = 1e-8 or so (see Box below for computations). It appears that at ~32x only half of the situations described above will be attributable to inadequate coverage, while other half will be true ‘de novo’ mutations.
     75
     76Assume the heterozygote call is made when at least two reads show the variant. Let us also assume for the moment that coverage is always Nx. Denote reference sequence as “R” and alternative as “A”, so in fact the person is R/A. Let us compute the probability that we miss this heterozygote (i.e. will call it A/A or R/R):
     77
     78P(call R/A as R/R or A/A) = P(all N read R) + P([N-1] reads are R, and 1 read is A) + P(all N read A) + P([N-1] reads are A, and 1 read is R)
     79
     80Assuming that probability of reads follows binomial distribution, we get
     81
     82P(call R/A as R/R or A/A) = 2*(N+1)*(1/2)!^N
     83
     84P(call R/A as R/R or A/A) ~ 1e-8 at N ~ 32
     85
     86== (2) Exploit tagging of same-window reads ==
     87
     88Basically to detect ‘de novo’ we need a situation when WITHIN THE SAME READ WINDOW (or paired-end read window) both parental chromosomes are tagged by a variant, and we see the third variant appearing in this context in child only
     89
     90Below is a naïve example of a situation when we could be able to detect ‘de novo’ mutation “C” (in red). Note that this is only one situation when we can clearly see that “C” is ‘de novo’. More situations can be worked out following the same logic.
     91
     92r: reference. A, B: alternative variants tagging the sequence.
     93
     94Reads in one of the parents
     95
     96{{{
     97rrrrrArrrr
     98
     99rrrrrArrrr
     100
     101rrrrrArrrr
     102
     103rrrrrArrrr
     104
     105rrrrrArrrr
     106
     107rrrrrArrrr
     108
     109rrrrrrrrrr
     110
     111rrrrrrrrrr
     112
     113rrrrrrrrrr
     114
     115rrrrrrrrrr
     116
     117rrrrrrrrrr
     118
     119rrrrrrrrrr
     120
     121}}} 
     122
     123Other parent reads
     124
     125{{{
     126
     127rBrrrrrrrr
     128
     129rBrrrrrrrr
     130
     131rBrrrrrrrr
     132
     133rBrrrrrrrr
     134
     135rBrrrrrrrr
     136
     137rrrrrrrrrr
     138
     139rrrrrrrrrr
     140
     141rrrrrrrrrr
     142
     143rrrrrrrrrr
     144
     145rrrrrrrrrr
     146
     147rrrrrrrrrr
     148
     149rrrrrrrrrr
     150
     151}}} 
     152
     153Reads in offspring
     154
     155{{{ 
     156
     157rrCrrArrrr
     158
     159rrCrrArrrr
     160
     161rrCrrArrrr
     162
     163rrCrrArrrr
     164
     165rrCrrArrrr
     166
     167rrCrrArrrr
     168
     169rrrrrrrrrr
     170
     171rrrrrrrrrr
     172
     173rrrrrrrrrr
     174
     175rrrrrrrrrr
     176
     177rrrrrrrrrr
     178
     179rrrrrrrrrr
     180
     181}}} 
     182
     183To address whether this is realistic scenario under which we can detect de novo mutations, we need to answer the question about probability that, given ‘de novo’ mutation occurs, what is the chance we will see that mutation in at least four reads (it is clear that for ‘de novo’ we must use more stringent calling criteria) and that in at least two of these 4 reads we will also see a heterozygote coming from a parent. Computations estimating this chance are provided below in the Box.
     184
     185From these computations, it appears that the chance to see ‘de novo’ in 4 or more reads, and see an existing (transmitted from a parent) variant in at least two of these reads is about 0.09. Thus, using outlined strategy we will be able to detect several de novo mutations per trio offspring, translating to hundreds (or thousands) de novo described from the whole data set. Note that in above we ignored the paired-end nature of our sequencing data, which, when properly accounted for, would probably double the numbers of detectable de novo mutations.
     186
     187The probability that we see a ‘de novo’ in at least 4 reads out of 12 is 0.93. The chance that an existing heterozygous site is covered in the same read can be computed assuming the read length of 100, uniform distribution of the read-start position across the genome, and heterozygote probability of 1/300 per site (Kai). Assume the ‘worst’ scenario of exactly 4 reads with ‘de novo’, what is the chance that in at least two of them we will see an existing heterozygote?
     188
     189Denoting the ‘de novo’ position in the read as 0, the ‘coverable’ position of a heterozygote may vary from -99 to +99. The chance that a heterozygote at +99 is included in the read is 0.01; if heterozygote is at +1, the chance is 0.99. Thus, for a heterozygote at position ‘j’ (j in -99 to -1 and 1 to 99) the chance to be included in the read is (1-abs(j/100)). We assume that a chance to have a ‘linked’ alternative variant at a position is ½ * 1/300 = 1/600. Thus the probability to detect a ‘linked’ variant in at least two reads out of 4 is:
     190
     191P(see variant in >=2 reads)
     192
     193= P(variant is at -99) * P(see variant in >=2 reads | variant is at -99) + P(variant is at -98) * P(see variant in >=2 reads | variant is at -98) + … + P(variant is at +99) * P(see variant in >=2 reads | variant is at +99)
     194
     195= 1/600 (P(see variant in >=2 reads | variant is at -99) + … P(see variant in >=2 reads | variant is at +99))
     196
     197= 1/600 [ 2 * SUM,,j=(1,99),, SUM,,k=2,4,, (1-j/100)^k^ * (j/100)^(4-k)^ ]
     198
     199Evaluation of this expression gives 
     200
     201P(see variant in >=2 reads) = 0.09
     202
     203Thus the joint probability to see ‘de novo’ in >=4 reads and see an established variant transmitted from a parent in at least 2 of these reads is 0.93*0.09 = 0.086.
     204
     205== Conclusions ==
     206
     207From above computations it looks like both increasing coverage in parents (and may be offspring) of selected trios to >32x, and exploitation of information from the same reads may make detection of ‘de novo’ variants feasible.
     208
     209Note that above computations cannot be considered as final; multiple assumptions and approximations were made, it will depend on goodness of these assumptions and approximations how far off the true answer the provided figures are. Still, the true answer should be the same order of magnitude – which was our initial aim – to see if ‘de novo’ project looks at all feasible or not.
     210
     211Before any of these lines can be followed up, thorough discussion and further computations / simulations should be done to relax the assumption that N is constant (use N ~ Poisson(Lambda) instead) and also taking into account error probability (not considered above).
     212
     213 
     214
     215