Team:KU Leuven/Journal
From 2013.igem.org
Line 32: | Line 32: | ||
<div class="span12 icon-small white"> | <div class="span12 icon-small white"> | ||
<div class="row-fluid"> | <div class="row-fluid"> | ||
- | <div class="span2 bg- | + | <div class="span2 bg-yellow1 visible-desktop"> |
<a href="https://2013.igem.org/Team:KU_Leuven/Journal/EBF/wetlab"> | <a href="https://2013.igem.org/Team:KU_Leuven/Journal/EBF/wetlab"> | ||
<i class="livicon activeicon" data-name="bell" data-onparent="true" data-color="white"></i> | <i class="livicon activeicon" data-name="bell" data-onparent="true" data-color="white"></i> |
Revision as of 20:58, 3 October 2013
Secret garden
Congratulations! You've found our secret garden! Follow the instructions below and win a great prize at the World jamboree!
- A video shows that two of our team members are having great fun at our favourite company. Do you know the name of the second member that appears in the video?
- For one of our models we had to do very extensive computations. To prevent our own computers from overheating and to keep the temperature in our iGEM room at a normal level, we used a supercomputer. Which centre maintains this supercomputer? (Dutch abbreviation)
- We organised a symposium with a debate, some seminars and 2 iGEM project presentations. An iGEM team came all the way from the Netherlands to present their project. What is the name of their city?
Now put all of these in this URL:https://2013.igem.org/Team:KU_Leuven/(firstname)(abbreviation)(city), (loose the brackets and put everything in lowercase) and follow the very last instruction to get your special jamboree prize!
Feed forward loop
The progress that has been made by the subteam working on the 'Feed forward loop', can be found here. The 'Feed Forward Loop' is a part of the oscillator.
Methyl Salicylate
Robbert and Laurens worked round the clock almost whole summer. Their story can be found here. More information on the MeS biobrick can be found on this page.
qPCR
We spent some time on performing a qPCR, a new and appeasing way to characterise and to find data for our computer model.