Introduction
As described before, we did not create a completely faithful representation of a full adder. When we were first planning the circuit, one major simplifying (and simple) insight we had was that the full adder is just a counting machine. The output only depends on how many inputs are activated; it does not matter which ones are on. With this observation, we could look at the adder as a four state switch, whose state depends on how many inputs are on. This was much easier to work with as demonstrated by the difference in complexity of the two tables below.
Inputs |
State (Output our circuit gives) |
0 |
A (No output) |
1 |
B (RFP) |
2 |
C (RFP and GFP) |
3 |
D (RFP, GFP, and CFP) |
Our circuit relies on three inducible/repressible promoters to sense inputs: pBad, pLacL, and ptrpL. It is important to note, however, that since the type of signal is not important, these promoters can be interchanged with other promoters, allowing for a wide variety of adders specific to different kinds of signals. The 0 input for each promoter is the input that renders no transcription from the corresponding promoter. Since ptrpL is an inducible repressor, the 0 input is, counter-intuitively, tryptophan-supplemented media. The 0 input for the other two promoters occurs in media that is not supplemented with the corresponding inducer. The 1 input for each promoter is just the opposite.
Legend: RFP - full length red fluorescent protein. GFP1 - N-terminal half of split green fluorescent protein (nzGFP). GFP2 - C-terminal half of split green fluorescent protein (czGFP). GFP - full length green fluorescent protein. CFP1 - N-terminal half of split cyan fluorescent protein (nzCFP). CFP2 - C-terminal half of split cyan fluorescent protein (czCFP). T7 ptag - T7 polymerase with amber mutation. supD - Amber mutation suppressor.
The easiest way to understand the circuit is to go on a case-by-case basis. For simplicity, we have labeled the promoters A, B, and C. Note that our target outputs are given in Figure Y above. We will indicate whether a promoter is activated or inactivated and ignore the details of how the promoter is activated or inactivated.
Zero inputs - Desired output: no fluorescence
Without activation at the promoters and assuming low basal transcription, we should see no fluorescence.
One input - Desired output: Red fluorescence
If only A is activated, then functional RFP, nzGFP, and T7ptag are produced. Since czGFP and supD are not produced, nzGFP and T7ptag are non-functional. Therefore, we should only observe RFP output.
If only B is activated, then functional RFP, nzGFP, and supD are produced. Again, we should only observe RFP output.
If only C is activated, then functional RFP, czGFP, and nzCFP are produced. Once again, we should only observe RFP output.
Two inputs - Desired output: Red and green fluorescence
If A and B are activated, we should observe RFP output, as before. Transcription from both A and B result in nzGFP. Since there is no czGFP, nzGFP should remain non-functional. However, supD and T7 ptag are created, allowing transcription from the T7 promoter, expressing non-split, functional GFP and czCFP. Since nzCFP is not created, czCFP remains non-functional. Therefore, we expect only RFP and GFP output.
If A and C are activated, we should observe see RFP output as before. Transcription from promoter A gives nzGFP and promoter C gives czGFP, allowing formation of functional GFP. T7 ptag is also created but supD is not, so T7 ptag should remain non-functional. Finally, nzCFP is created without its partner. So we should observe RFP and GFP output.
If B and C are activated, we have a similar situation, but instead of non-functional T7 ptag, we have non-functional supD. So we should observe RFP and GFP output.
Three inputs - Desired output: Red, green, and cyan fluorescence
If everything is activated, everything is created, so we should observe RFP, GFP, and CFP output.
Back to an electrical circuit
After designing the circuit, we wondered how different our adder is from an electrical full adder. To answer this question, we needed to know what kind of electrical circuit our genetic circuit corresponds to.
Full Adder Electrical Circuit
Full Adder Genetic Circuit
We see that our circuit has one additional output and consists of only 4 AND gates. Although there are many different ways to construct a digital full adder, there are none that use only 4 gates (one of the simplest ones is shown, which uses 5 gates) and none that use only AND gates. Because of the additional output, we say our output is “encoded.”
|
|