ETH Zurich 2006
From 2006.igem.org
(→system structure) |
(added link to FTD article) |
||
(66 intermediate revisions not shown) | |||
Line 2: | Line 2: | ||
<BR/><b>standing (L-R):</b> Marco, Alexandra, Arthur, Olga, Dimo, Marko, Robert; <b>in front (L-R):</b> | <BR/><b>standing (L-R):</b> Marco, Alexandra, Arthur, Olga, Dimo, Marko, Robert; <b>in front (L-R):</b> | ||
Franz, Michael</center> | Franz, Michael</center> | ||
+ | <br><br> | ||
+ | |||
+ | <center> | ||
+ | '''>>>>>>>>>>>> [http://www.zfranz.ch.vu/iGEM/ETH-iGEM-%202006-%20presentation.pdf Download ETH iGEM presentation 2006 as PDF] <<<<<<<<<<<<''' | ||
+ | </center> | ||
+ | |||
+ | <center> | ||
+ | '''>>>>>>>>>>>>> [http://www.fotofranz.ch.vu/igem See pictures of the iGEM Jamboree in Boston] <<<<<<<<<<<<<''' | ||
+ | </center> | ||
+ | |||
+ | <center> | ||
+ | '''>>>>>>>>>>>>> [http://ftd.de/forschung/154366.html Read article in Financial Times Deutschland: "Eins plus eins gleich Grün" (german only)] <<<<<<<<<<<<<''' | ||
+ | </center> | ||
<br><br> | <br><br> | ||
Line 11: | Line 24: | ||
What the addition of numbers has to do with pattern recognition, how our model and the mathematical analysis look like, and how the experiments are realized will be explained on these wiki pages. We wish you a pleasant time with our pages. Enjoy it! | What the addition of numbers has to do with pattern recognition, how our model and the mathematical analysis look like, and how the experiments are realized will be explained on these wiki pages. We wish you a pleasant time with our pages. Enjoy it! | ||
</blockquote> | </blockquote> | ||
+ | |||
<br><br> | <br><br> | ||
Line 19: | Line 33: | ||
==== Modeling ==== | ==== Modeling ==== | ||
- | *'''Parts''' Model the whole System with Sensing, | + | *'''Parts''' Model the whole System with Sensing, PoPS duplexer and Half adder (Marco and Franz) -- probably not |
*Model whether a different strength of input is necessary for the AND and XOR Gates (Marco) | *Model whether a different strength of input is necessary for the AND and XOR Gates (Marco) | ||
*Finish modeling the second AND Gate and find a biological way to implement it and write the DNA and order it (Marco and Robert) -- probably not | *Finish modeling the second AND Gate and find a biological way to implement it and write the DNA and order it (Marco and Robert) -- probably not | ||
Line 30: | Line 44: | ||
*Read the literature on the XOR and AND Gates, check carefully for strains needed and compatibility of the parts (Who?) | *Read the literature on the XOR and AND Gates, check carefully for strains needed and compatibility of the parts (Who?) | ||
*Prepare a protocol for parts assembly (Olga) | *Prepare a protocol for parts assembly (Olga) | ||
- | |||
- | |||
- | |||
- | |||
==== Documentation ==== | ==== Documentation ==== | ||
Line 40: | Line 50: | ||
* enter lab experience report to registry | * enter lab experience report to registry | ||
- | * Make a drawing of the DNA to have an overview of which parts will be consecutively on the same DNA piece (Alexandra) (this is part of the [[# | + | * Make a drawing of the DNA to have an overview of which parts will be consecutively on the same DNA piece (Alexandra) (this is part of the [[#System deployment]] section --[[User:Ajk|Ajk]]) |
* Revise images & graphics (Marco): | * Revise images & graphics (Marco): | ||
** correct errors | ** correct errors | ||
Line 51: | Line 61: | ||
* design and write the final presentation (with LaTex beamer class) IN PROCESS | * design and write the final presentation (with LaTex beamer class) IN PROCESS | ||
- | |||
- | |||
- | |||
Structure: | Structure: | ||
- | 1. Introduction of the team and ETH Zurich and of the half-adder idea - about | + | 1. Introduction of the team and ETH Zurich and of the half-adder idea - about 3 min |
- | 2. Engineering Part - about | + | 2. Engineering Part - about 9 min |
3. Biological part - about 8 min | 3. Biological part - about 8 min | ||
Line 69: | Line 76: | ||
Available as Google Calendar: [http://www.google.com/calendar/render?cid=pqi8ni6gnfj5r3o0np0h4smrr4@group.calendar.google.com iGEM 2006 ETH Zurich] | Available as Google Calendar: [http://www.google.com/calendar/render?cid=pqi8ni6gnfj5r3o0np0h4smrr4@group.calendar.google.com iGEM 2006 ETH Zurich] | ||
- | ; | + | ;past:see [[ETH Schedule Archive|here]] |
- | ; | + | ;16.11.: Jamboree wrap up (with T-Shirts!), 5pm at CNB seminar room |
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | === | + | === Team members === |
+ | {| cellspacing="0px" cellpadding="5px" style="border-style:solid;border-width:thin;border-color:#dddddd;" rules="all" | ||
+ | |- | ||
+ | | [[User:Paolo Pinkel|Michael Friedmann]] || [[User:Dimo|Dimo Brockhoff]] || [[Franz|Franz Zürcher]] | ||
+ | |- | ||
+ | | [[Olga Nikolayeva]] || [[User:Choutkoa|Alexandra Choutko]] || [[User:Ajk|Arthur Korn]] | ||
+ | |- | ||
+ | | [[User:Rschuetz|Robert Schütz]] || [[User:Terzerm|Marco Terzer]] || [[Marko Jovanovic]] | ||
+ | |} | ||
- | + | == Finding a Project == | |
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
+ | Finding a project to work on is not easy. Not because it is hard to find interesting projects but because there are too many of them. In the first weeks we did a lot of brainstorming including thoughts about the projects' feasibility. You can find a list of ideas [[ETH 2006 Ideas|here]]. | ||
- | + | During the weeks, we decided to split up the whole team into two groups. Each group proposed a project after these two weeks of separated work: | |
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
* [[ETH 2006 Meat Monitor|Meat monitor project]] (Michael, Dimo, Olga, Arthur, Marko) | * [[ETH 2006 Meat Monitor|Meat monitor project]] (Michael, Dimo, Olga, Arthur, Marko) | ||
* [[ETH 2006 Half adder|Half adder/pattern recognition project]] (Franz, Alexandra, Robert, Marco) | * [[ETH 2006 Half adder|Half adder/pattern recognition project]] (Franz, Alexandra, Robert, Marco) | ||
- | + | After the proposals, we decided to further pursue the half adder project idea. | |
- | == | + | == Design process == |
- | + | === System behavorial specification === | |
- | + | ||
- | === | + | |
- | + | ||
- | + | ||
# Write something with a chemical on a petri plate (like '''ETH''' for example) | # Write something with a chemical on a petri plate (like '''ETH''' for example) | ||
Line 133: | Line 122: | ||
C: no fluorescence | C: no fluorescence | ||
- | |||
- | + | An experiment in the lab could for instance look like this: | |
- | |||
- | + | [[image:ETH_Pattern_Experiment.png|center|400px|pattern experiment]] | |
- | |||
- | |||
- | |||
- | + | or like this: | |
- | |||
- | + | [[image:ETH_Eth_Experiment.png|center|300px|eth experiment]] | |
- | + | Considering the green and the red output as being separate, the logic mapping the input states to the output states is AND for the GFP and XOR for the RFP. Together they amount to a half adder logic. | |
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | The whole system is only considered at it's steady state, dynamic processes are only of minor interest. | |
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | === System structure === | |
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | The whole process can be brought into a common input, logic, output form: | |
- | + | ||
- | + | [light sensing]----->[ ]-->[reporter A] | |
- | + | [ logic ] | |
- | + | [chemical sensing]-->[ ]-->[reporter B] | |
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | As it turns out, a [http://en.wikipedia.org/wiki/Full_adder half-adder] can be used as logic part. To understand what a half-adder is, let us first have a brief look at how we add numbers by hand. | |
- | + | If we add two (large) numbers, we usually start with the least significant digits and add these two digits: | |
- | + | 1234 | |
+ | + 9684 | ||
+ | ------ | ||
+ | ....8 | ||
- | + | In the example, the digit's sum is smaller than 10. Thus, we do not need to keep the carry-over in mind (it is zero in this case). For the second digit, the sum is 11 and we have to memorize the carry 1 and so forth: | |
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | 1234 1234 1234 1234 | |
+ | + 9684 + 9684 + 9684 + 9684 | ||
+ | 1 1 | ||
+ | ------ ------ ------ ------ | ||
+ | ...18 ..918 .0918 10918 | ||
- | + | In general, each addition step produces the sum, consisting of the current digit of the sum and the carry digit. The only difference between the first and the other steps are the ''inputs'': When the addition starts, there is no carry bit. The inputs are the two least significant digits of our two numbers. All further steps consider the two current digits of our numbers plus the carry-over from the previous step. | |
- | + | If you add two numbers with your pocket calculator or your computer, the underlying principle is the same. The only difference is that electronical devices normally work with binary numbers instead of decimal ones. The digits are then only 0 and 1 instead of 0,1,2,...,8, and 9. A half-adder device does the first addition step in an electronical adder; | |
+ | it can add two binary input values, the least significant bits of the two numbers. It has also two binary outputs, the sum value S and a carry out C. Two half-adders can be combined to a full-adder, which can be used for the computation of the other (higher valued) bits. | ||
- | + | A half adder can be constructed from two simplier well-known electronical devices: an XOR gate (the sum value S) and an AND gate (the carry out): | |
- | + | A A | |
- | + | ^ ^ | |
- | + | 1| 1 0 1 | 0 1 | |
- | + | 0| 0 1 0 | 0 0 | |
- | + | +-----> B +----> B | |
- | + | 0 1 0 1 | |
- | + | S = A XOR B C = A AND B | |
- | + | The sum output S and the carry out C are exactly the values needed for our system. The resulting system architecture is: | |
- | + | [[image:ETH_System_Architecture.png|center| |system architecture]] | |
- | + | === System modeling === | |
- | + | According to the system structure, we first decompose our overall system into devices: | |
+ | * [[ETH2006_xor| XOR Gate]] | ||
+ | * [[ETH2006_and| AND Gate]] | ||
+ | * [[ETH2006_iptg| IPTG (Chemical) Sensing]] | ||
+ | * [[ETH2006_light| Light Sensing]] | ||
+ | * [[ETH2006_copy| PoPS Duplexer]] | ||
+ | The dynamic behavior of each device was modeled by a set of ODEs (ordinary differential equations). The steady-state we are interested in was determined by simulating the system until all the states (concentrations and rates) settled down to rather constant values. This method is not mathematically sound as systems might settle to different steady-states depending on the initial conditions, or the system might regain momentum after almost, but no completely, settling down. The first concern can be adressed by running simulations starting from varying initial conditions and verifying that there is only a single steady-state, the second issue is rather theoretical as this kind of behaviour is rarely found in real systems. | ||
- | ==== | + | ==== Modular simulation ==== |
+ | Modular modeling allows simulation at different detail levels, e.g. | ||
- | + | * reusable complexes reoccurring in different devices, like | |
+ | ** transcription | ||
+ | ** translation | ||
+ | ** encymatic reactions | ||
+ | * single devices, different variants of same device type, as a basis of decisionmaking | ||
+ | * 2 or several connected devices → for instance to see which duplexer variant fits better with which AND/XOR gate variant | ||
+ | * overall system → to see if everything together still works | ||
- | + | We have developed such a modular system in MATLAB: | |
- | + | * the current implementation defines modules at device level (reusable complexes is a pending issue) | |
- | + | * modules mainly are characterized by number/kind of input and output and can be simulated with an appropriate simulation function | |
- | + | * input/output kind: we destiguish between ''concentration'' and ''rate (PoPS)'' | |
- | + | * the modules have 1-2 inputs/ouptus, for instance 2 inputs/1 ouptut for AND/XOR gate | |
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | === | + | ==== Parameter estimation & sensitivity analysis ==== |
+ | It is known, and we have made the same (sometimes painful) experience that parameter estimation is the most difficult and laborious part of modeling. Most parameters are simply not known, and estimating them sometimes approaches playing dice. | ||
- | + | One way to address this problem is sensitivity analysis: if we change some parameter, what effect has it on the behavior of the model? The sensitivity matrix S at steady state can be computed with the jacobian matrices of the ODEs with respect to the states (concentrations) and parameters. To be able to compare the results, parameter and state values are normalized, that is, the changes are expressed relative to the unperturbed value. | |
- | + | ||
- | + | ||
- | ( | + | Sensitivity analysis gives clues about |
+ | * whether our models behaviour resembles the desired behavior | ||
+ | * which parameters have hardly any effect on the relevant states (they don't have to be considered further and can be fixed to some arbitary value) | ||
+ | * which parameters influence the relevant states significantly and thus deserve further attention | ||
- | + | ==== The role of modeling ==== | |
- | + | ||
- | + | ||
+ | With all the uncertainties and difficulties (such as parameter estimation) the question might raise whether modeling is worthwile at all. Our answer is yes, but one has to think of modeling as an integrated process. It should not be seen as a precursor phase of experiment and synthesis, it is part of the design cycle. | ||
+ | After brainstorming and selecting a project, we started with abstract models of the necessary devices on a very schematic level. For instance, we came up with different theoretical models for the XOR and AND gates - without considering biology too much at this early stage. Then we looked for biological systems which resembled one of our models - the literature research was to some extent model driven. We refined the remaining models and simulated the devices for the first time - here, the ODEs and MATLAB joined in. These models helped a lot in deciding which gate variants should be prefered. As we gained knowledge about possible biological implementations, the models where constantly adapted. | ||
+ | Important is also the interaction of modeling and experiments. Modeling and sensitivity analysis can suggest where observed difficulties arise and thus guide the experiments that pin down the problem, eventually leading to a solution. | ||
+ | === System deployment === | ||
- | + | We will assemble the AND gate plus the XOR gate on two seperate plasmids (pACYC177 and pACYC184 from NEB). In order for our system to be tested we need a special strain expressing lacI and tetR. In our case we plan to use strain DH5αZ1. | |
- | + | === System test procedure === | |
- | + | ||
- | ==== | + | |
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | In order to test the functionality of the gates experimentally, we decided to mimic the signal inputs via two well controllable inducible promoters. This will help us to test the gates under different input conditions and help in determining the limits of our system. As inducible promoters we chose the lactose-inducible promoter (Plac) and the tetracycline-inducible promoter (Ptet). Both promoters are well described in literature and also tested extensively. However, in order to test our system with those two promoters, we will need to use a special e. coli strain, designed our whose genome encodes for the tetR and lacI gene (e.g. DH5αZ1 strain). The two promoters are flanked by unique restriction sites, so that once the gates are tested, these promoters can be easily exchanged by any promoter of interest. Consequently, our gates could be coupled to a number of other promoters that respond to a desired input signal. | |
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
== [[ETH_2006_Docs_And_Links|Useful Documents & Links]] == | == [[ETH_2006_Docs_And_Links|Useful Documents & Links]] == | ||
[[ETH_2006_Docs_And_Links|see here]] | [[ETH_2006_Docs_And_Links|see here]] |
Latest revision as of 10:15, 19 February 2007
standing (L-R): Marco, Alexandra, Arthur, Olga, Dimo, Marko, Robert; in front (L-R):
>>>>>>>>>>>> [http://www.zfranz.ch.vu/iGEM/ETH-iGEM-%202006-%20presentation.pdf Download ETH iGEM presentation 2006 as PDF] <<<<<<<<<<<<
>>>>>>>>>>>>> [http://www.fotofranz.ch.vu/igem See pictures of the iGEM Jamboree in Boston] <<<<<<<<<<<<<
>>>>>>>>>>>>> [http://ftd.de/forschung/154366.html Read article in Financial Times Deutschland: "Eins plus eins gleich Grün" (german only)] <<<<<<<<<<<<<
Adding numbers is easy, isn't it? 1234 plus 5678, for example, is 6912. But how do engineers add binary numbers instead of decimal ones? And how, in the end, can this be done by a living cell? We, the members of the ETH Zurich 2006 iGEM team, are currently working on these questions, whereas the last one seems to be not trivial.
What the addition of numbers has to do with pattern recognition, how our model and the mathematical analysis look like, and how the experiments are realized will be explained on these wiki pages. We wish you a pleasant time with our pages. Enjoy it!
Contents |
Coordination
TODOs
Modeling
- Parts Model the whole System with Sensing, PoPS duplexer and Half adder (Marco and Franz) -- probably not
- Model whether a different strength of input is necessary for the AND and XOR Gates (Marco)
- Finish modeling the second AND Gate and find a biological way to implement it and write the DNA and order it (Marco and Robert) -- probably not
- Bring model parameter up to date & update simulation results/senisitivity analysis (Marco)
Lab
Responsible: Robert for the preparatory experiments, Olga for the assembly and testing of the gates.
- Read the literature on the XOR and AND Gates, check carefully for strains needed and compatibility of the parts (Who?)
- Prepare a protocol for parts assembly (Olga)
Documentation
Responsible: Alexandra for the registry, Arthur for the Wiki.
- enter lab experience report to registry
- Make a drawing of the DNA to have an overview of which parts will be consecutively on the same DNA piece (Alexandra) (this is part of the #System deployment section --Ajk)
- Revise images & graphics (Marco):
- correct errors
- unify symbols
- extract missing ones from slides, see here
Presentation/Poster and PR
Responsible: Franz for the presentation, Dimo for PR/Poster
- design and write the final presentation (with LaTex beamer class) IN PROCESS
Structure:
1. Introduction of the team and ETH Zurich and of the half-adder idea - about 3 min
2. Engineering Part - about 9 min
3. Biological part - about 8 min
(4.) Questions from the audience - 10min (I think, Marco (modelling) and Marko (biology) should also be ready to answer questions)
Schedule
Available as Google Calendar: [http://www.google.com/calendar/render?cid=pqi8ni6gnfj5r3o0np0h4smrr4@group.calendar.google.com iGEM 2006 ETH Zurich]
- past
- see here
- 16.11.
- Jamboree wrap up (with T-Shirts!), 5pm at CNB seminar room
Team members
Michael Friedmann | Dimo Brockhoff | Franz Zürcher |
Olga Nikolayeva | Alexandra Choutko | Arthur Korn |
Robert Schütz | Marco Terzer | Marko Jovanovic |
Finding a Project
Finding a project to work on is not easy. Not because it is hard to find interesting projects but because there are too many of them. In the first weeks we did a lot of brainstorming including thoughts about the projects' feasibility. You can find a list of ideas here.
During the weeks, we decided to split up the whole team into two groups. Each group proposed a project after these two weeks of separated work:
- Meat monitor project (Michael, Dimo, Olga, Arthur, Marko)
- Half adder/pattern recognition project (Franz, Alexandra, Robert, Marco)
After the proposals, we decided to further pursue the half adder project idea.
Design process
System behavorial specification
- Write something with a chemical on a petri plate (like ETH for example)
- Let Bacteria grow uniformly on the plate
- Expose the plate to a picture (black and white) of the same pattern
- Result:
- Bacteria gets green when pattern on the plate and picture match (light and chemical)
- Bacteria does not express fluorescent protein when pattern on the plate and picture match (no light and no chemical)
- Bacteria gets red when pattern on the plate and picture do not match
light no light chemical A B no chemical B C
The outputs can be reported by fluorescent proteins, the mapping of states to outputs is arbitary, our choice is:
A: green B: red C: no fluorescence
An experiment in the lab could for instance look like this:
or like this:
Considering the green and the red output as being separate, the logic mapping the input states to the output states is AND for the GFP and XOR for the RFP. Together they amount to a half adder logic.
The whole system is only considered at it's steady state, dynamic processes are only of minor interest.
System structure
The whole process can be brought into a common input, logic, output form:
[light sensing]----->[ ]-->[reporter A] [ logic ] [chemical sensing]-->[ ]-->[reporter B]
As it turns out, a [http://en.wikipedia.org/wiki/Full_adder half-adder] can be used as logic part. To understand what a half-adder is, let us first have a brief look at how we add numbers by hand.
If we add two (large) numbers, we usually start with the least significant digits and add these two digits:
1234 + 9684 ------ ....8
In the example, the digit's sum is smaller than 10. Thus, we do not need to keep the carry-over in mind (it is zero in this case). For the second digit, the sum is 11 and we have to memorize the carry 1 and so forth:
1234 1234 1234 1234 + 9684 + 9684 + 9684 + 9684 1 1 ------ ------ ------ ------ ...18 ..918 .0918 10918
In general, each addition step produces the sum, consisting of the current digit of the sum and the carry digit. The only difference between the first and the other steps are the inputs: When the addition starts, there is no carry bit. The inputs are the two least significant digits of our two numbers. All further steps consider the two current digits of our numbers plus the carry-over from the previous step.
If you add two numbers with your pocket calculator or your computer, the underlying principle is the same. The only difference is that electronical devices normally work with binary numbers instead of decimal ones. The digits are then only 0 and 1 instead of 0,1,2,...,8, and 9. A half-adder device does the first addition step in an electronical adder; it can add two binary input values, the least significant bits of the two numbers. It has also two binary outputs, the sum value S and a carry out C. Two half-adders can be combined to a full-adder, which can be used for the computation of the other (higher valued) bits.
A half adder can be constructed from two simplier well-known electronical devices: an XOR gate (the sum value S) and an AND gate (the carry out):
A A ^ ^ 1| 1 0 1 | 0 1 0| 0 1 0 | 0 0 +-----> B +----> B 0 1 0 1 S = A XOR B C = A AND B
The sum output S and the carry out C are exactly the values needed for our system. The resulting system architecture is:
System modeling
According to the system structure, we first decompose our overall system into devices:
The dynamic behavior of each device was modeled by a set of ODEs (ordinary differential equations). The steady-state we are interested in was determined by simulating the system until all the states (concentrations and rates) settled down to rather constant values. This method is not mathematically sound as systems might settle to different steady-states depending on the initial conditions, or the system might regain momentum after almost, but no completely, settling down. The first concern can be adressed by running simulations starting from varying initial conditions and verifying that there is only a single steady-state, the second issue is rather theoretical as this kind of behaviour is rarely found in real systems.
Modular simulation
Modular modeling allows simulation at different detail levels, e.g.
- reusable complexes reoccurring in different devices, like
- transcription
- translation
- encymatic reactions
- single devices, different variants of same device type, as a basis of decisionmaking
- 2 or several connected devices → for instance to see which duplexer variant fits better with which AND/XOR gate variant
- overall system → to see if everything together still works
We have developed such a modular system in MATLAB:
- the current implementation defines modules at device level (reusable complexes is a pending issue)
- modules mainly are characterized by number/kind of input and output and can be simulated with an appropriate simulation function
- input/output kind: we destiguish between concentration and rate (PoPS)
- the modules have 1-2 inputs/ouptus, for instance 2 inputs/1 ouptut for AND/XOR gate
Parameter estimation & sensitivity analysis
It is known, and we have made the same (sometimes painful) experience that parameter estimation is the most difficult and laborious part of modeling. Most parameters are simply not known, and estimating them sometimes approaches playing dice.
One way to address this problem is sensitivity analysis: if we change some parameter, what effect has it on the behavior of the model? The sensitivity matrix S at steady state can be computed with the jacobian matrices of the ODEs with respect to the states (concentrations) and parameters. To be able to compare the results, parameter and state values are normalized, that is, the changes are expressed relative to the unperturbed value.
Sensitivity analysis gives clues about
- whether our models behaviour resembles the desired behavior
- which parameters have hardly any effect on the relevant states (they don't have to be considered further and can be fixed to some arbitary value)
- which parameters influence the relevant states significantly and thus deserve further attention
The role of modeling
With all the uncertainties and difficulties (such as parameter estimation) the question might raise whether modeling is worthwile at all. Our answer is yes, but one has to think of modeling as an integrated process. It should not be seen as a precursor phase of experiment and synthesis, it is part of the design cycle.
After brainstorming and selecting a project, we started with abstract models of the necessary devices on a very schematic level. For instance, we came up with different theoretical models for the XOR and AND gates - without considering biology too much at this early stage. Then we looked for biological systems which resembled one of our models - the literature research was to some extent model driven. We refined the remaining models and simulated the devices for the first time - here, the ODEs and MATLAB joined in. These models helped a lot in deciding which gate variants should be prefered. As we gained knowledge about possible biological implementations, the models where constantly adapted.
Important is also the interaction of modeling and experiments. Modeling and sensitivity analysis can suggest where observed difficulties arise and thus guide the experiments that pin down the problem, eventually leading to a solution.
System deployment
We will assemble the AND gate plus the XOR gate on two seperate plasmids (pACYC177 and pACYC184 from NEB). In order for our system to be tested we need a special strain expressing lacI and tetR. In our case we plan to use strain DH5αZ1.
System test procedure
In order to test the functionality of the gates experimentally, we decided to mimic the signal inputs via two well controllable inducible promoters. This will help us to test the gates under different input conditions and help in determining the limits of our system. As inducible promoters we chose the lactose-inducible promoter (Plac) and the tetracycline-inducible promoter (Ptet). Both promoters are well described in literature and also tested extensively. However, in order to test our system with those two promoters, we will need to use a special e. coli strain, designed our whose genome encodes for the tetR and lacI gene (e.g. DH5αZ1 strain). The two promoters are flanked by unique restriction sites, so that once the gates are tested, these promoters can be easily exchanged by any promoter of interest. Consequently, our gates could be coupled to a number of other promoters that respond to a desired input signal.