Team:NUDT CHINA/Notebook
From 2014.igem.org
(Prototype team page) |
|||
Line 2: | Line 2: | ||
- | + | <html> | |
+ | |||
+ | <!--main content --> | ||
+ | <table width="960px" align="center"> | ||
+ | |||
+ | <tr> | ||
+ | <td> | ||
+ | <table width="100%"><tr><td width="80%"> | ||
+ | <p> | ||
+ | <h3>The Transformation of Our iGEM Ideas</h3></p><p> | ||
+ | Originally, we were attracted by the <i>Shortest Path Problem</i>, which aims to find the shortest path in a directed graph that can link the beginning node and ending node. Be inspired, we decided to design a cascade pathway <i>in vivo</i> which can help us read out the answer of Shortest Path Problem directly by the life stage of <i>E. coli</i>. | ||
+ | </p> | ||
+ | <p>The main problem in the design are:</p> | ||
+ | <ul> | ||
+ | <li>how to describe a route in <i>E. coli</i>;</li> | ||
+ | <li>how to build different routes in <i>E. coli</i>;</li> | ||
+ | <li>how to compare the length of different pathways.</li> | ||
+ | </ul> | ||
+ | </td><td width="20%" bgColor=#e7e7e7 valign="top"> | ||
+ | <ul> | ||
+ | <li><a href="https://2014.igem.org/Team:NUDT_CHINA">Home</a> </li> | ||
+ | <li><a href="https://2014.igem.org/Team:NUDT_CHINA/Team">Team</a> </li> | ||
+ | <li><a href="https://2014.igem.org/Team:NUDT_CHINA/Project">Project</a> </li> | ||
+ | <li><a href="https://2014.igem.org/Team:NUDT_CHINA/Parts">Parts</a> </li> | ||
+ | <li><a href="https://2014.igem.org/Team:NUDT_CHINA/Modeling">Modeling</a> </li> | ||
+ | <li><a href="https://2014.igem.org/Team:NUDT_CHINA/Notebook">Notebook</a> </li> | ||
+ | <li><a href="https://2014.igem.org/Team:NUDT_CHINA/Safety">Safety</a> </li> | ||
+ | <li><a href="https://2014.igem.org/Team:NUDT_CHINA/Attributions">Attributions</a> </li> | ||
+ | </ul> | ||
+ | </td> | ||
+ | </tr></table> | ||
+ | <p> | ||
+ | To solve the first problem, we built devices that contains promoter, RBS, target gene (CDS) and terminator to simulate the nodes and lines in directed graph: the promoters are nodes and the target fragment are lines. When the promoter is activated, the target gene can coding protein which then activate the next promoter as regulatory element. This regulatory process can describe how a man the walking in a directed graph: he departed from the node P1, went through the line L and finally arrived at the spot P2. In this way, theoretically, we can describe any given directed graph in <i>E. coli</i>. (For further details about the coding of the graph, please refer to the project profile of our wiki) (Fig. 1)</p> | ||
+ | <p><center><img src="https://static.igem.org/mediawiki/2014/0/04/NUDT_CHINA_Notes_idea_3part.png" width="302" heigth="128" /><br> | ||
+ | Fig. 1 One promoter and one target gene can simulate one node and one line | ||
+ | </center><p> | ||
+ | |||
+ | <p> | ||
+ | After building one complete graph in <i>E. coli</i>, different route should be labelled and tested independently so that we can get the length indirectly by the time of whole travel from beginning to ending. Then we can selected the quickest one as the shortest route. However, we are stuck in the second problem: how to build different route.</p> | ||
+ | |||
+ | <h5>First design:</h5></p> | ||
+ | |||
+ | <p> | ||
+ | In each regulatory unit, three different restrict enzyme sites are put between the promoter and RBS, target gene and terminator, terminator and next promoter, respectively. (Fig. 2) | ||
+ | </p> | ||
+ | <p><center> | ||
+ | <img src="https://static.igem.org/mediawiki/2014/5/58/NUDT_CHINA_Notes_idea_3part_fig2.png" width="302" height="119" /> | ||
+ | <br>Fig. 2 the position of three different restrict enzyme sites</center> | ||
+ | </p> | ||
+ | |||
+ | |||
+ | |||
+ | |||
- | |||
<!--main content --> | <!--main content --> |
Revision as of 15:27, 17 October 2014
To solve the first problem, we built devices that contains promoter, RBS, target gene (CDS) and terminator to simulate the nodes and lines in directed graph: the promoters are nodes and the target fragment are lines. When the promoter is activated, the target gene can coding protein which then activate the next promoter as regulatory element. This regulatory process can describe how a man the walking in a directed graph: he departed from the node P1, went through the line L and finally arrived at the spot P2. In this way, theoretically, we can describe any given directed graph in E. coli. (For further details about the coding of the graph, please refer to the project profile of our wiki) (Fig. 1) Fig. 1 One promoter and one target gene can simulate one node and one line
After building one complete graph in E. coli, different route should be labelled and tested independently so that we can get the length indirectly by the time of whole travel from beginning to ending. Then we can selected the quickest one as the shortest route. However, we are stuck in the second problem: how to build different route. First design:In each regulatory unit, three different restrict enzyme sites are put between the promoter and RBS, target gene and terminator, terminator and next promoter, respectively. (Fig. 2) Fig. 2 the position of three different restrict enzyme sites
|