Difference between revisions of "Team:Heidelberg/internal tools"
Lukas Adam (Talk | contribs) |
Lukas Adam (Talk | contribs) |
||
| Line 377: | Line 377: | ||
} | } | ||
| − | #container1 h1 { | + | #container1 h1, #container2 h1, #container3 h1, #container4 h1 { |
color:#393939; | color:#393939; | ||
font-family: 'Josefin Sans', sans-serif; | font-family: 'Josefin Sans', sans-serif; | ||
| Line 387: | Line 387: | ||
} | } | ||
| − | #container1 p { | + | #container1 p, #container2 p, #container3 p, #container4 p { |
color: #393939; | color: #393939; | ||
font-size: 20px; | font-size: 20px; | ||
font-family: 'Josefin Sans', sans-serif; | font-family: 'Josefin Sans', sans-serif; | ||
text-align: justify; | text-align: justify; | ||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
} | } | ||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
#form1 label { | #form1 label { | ||
| Line 416: | Line 401: | ||
color: #393939; | color: #393939; | ||
} | } | ||
| + | #form1 label, #form2 label, #form3 label, #form4 label { | ||
| + | font-family: 'Josefin Sans', sans-serif; | ||
| + | font-size: 20px; | ||
| + | font-weight: 300; | ||
| + | color: #393939; | ||
| + | } | ||
| + | |||
</style> | </style> | ||
Revision as of 10:39, 19 September 2017
WikitemplateA home
From 2014.igem.org
Internal Tools
Number of mutations and mutated sequences
Expected number of mutations in a single sequence: $$p_{m} = \frac{N_{mutations}}{L_{Sequence}} = N_{generations} * r_{mutation} = t_{total} * \Phi * r_{mutation}$$
The expected share of sequences that shows at least one mutation in \(L_{Sequence}\) bp is the probability that \(L_{sequence}\) basepairs stay unchanged when \(\frac{N_{mutations}}{L_{Sequence}}\) mutations are expected: $$p_{M} = \frac{N_{mutated}}{N_{Sequences}} = 1 - p(N_{mutations}=0) = 1 - (1-p_{m})^{L_{Sequence}} $$
With this equation we can also calculate the number of sequences \(N_{Sequences}\) that have to be sequenced in order to find a mutated one with a probability of \(p(N_{mutated} > 0)\). $$ N_{Sequences} = \frac{p(N_{mutated} > 0)}{p_{M}} $$
The probability to find at least one mutated sequence under the given conditions is $$p(N_{mutated}>0) = 1 - (1-p_{M})^{N_{sequences}}$$ which gives $$N_{Sequences} = \frac{ln(1-p(N_{mutated}>0))}{ln(1-p_{M})}$$
Set \(\Phi\) to zero to use the number of generations for the calculation. If \(\Phi\) and the number of generations are given, \(\Phi\) is used.
Consider \(L_{Sequence}\) as the number of basepairs that is expected to be mutated. If half of the sequence you are interested in, is highly conserved choose a lower \(L_{Sequence}\).
\(p_{m} =\) %(bp/bp).
\(N_{mutations} =\) bp per sequence.
The share of sequences that shows at least one mutation in \(L_{Sequence}\) bp is \(p_{M}=\) % of sequences
