Team:NUDT CHINA/Project
From 2014.igem.org
(Prototype team page) |
|||
Line 84: | Line 84: | ||
<tr> | <tr> | ||
<td width="45%" valign="top"> | <td width="45%" valign="top"> | ||
- | <p> | + | <p> |
+ | In graph theory, the Single Pair Shortest Path Problem (SPP) is one of the basic problems with many applications. Many computational methodssuch as Dijkstra algorithm, A-star search algorithm and Floyd-Warshal algorithm etc., can solve it in a tolerable computational complexity. However, as the technology of the traditional silicon computers is gradually meeting its physical limits, new methods of the high-volume computing has been looked for for years. As developing rapidly, synthetic biology makes bacterial computing possible and great potential. Programming <i>Escherichia coli</i>, the simplest model organism to implement these kinds of basic problems is very necessary. It will bring up with a brand new bio-computing method with better computational complexity.</p> | ||
+ | <p> | ||
+ | Here, we will design a series of genetic circuits in Escherichia coli to solve the SPP in a directed graph. The nodes and arrows are programed as well-assigned promoters and transcription factors (TFs) respectively. For each arrow, the promoter of its source node initiates the expression of the TF which induces specifically the promoter of the target node. The paths in the graph are described by the transcriptional regulatory cascades. The promoter of destination node in SPP is followed by a green fluorescent protein (GFP) as a reporter. The temporal ordering of the fluorescent protein expression in E.coli reflects the distance difference among varied paths. According theoretical analysis, we can find the the shortest path consisted by all those arrows with linear computational complexity. | ||
+ | </p> | ||
<br> | <br> | ||
<h3>References </h3> | <h3>References </h3> |
Revision as of 05:04, 15 August 2014
WELCOME TO iGEM 2014!Your team has been approved and you are ready to start the iGEM season!
|
||||||||||||
| ||||||||||||
Project Description |
Content |
|||||||||||
In graph theory, the Single Pair Shortest Path Problem (SPP) is one of the basic problems with many applications. Many computational methodssuch as Dijkstra algorithm, A-star search algorithm and Floyd-Warshal algorithm etc., can solve it in a tolerable computational complexity. However, as the technology of the traditional silicon computers is gradually meeting its physical limits, new methods of the high-volume computing has been looked for for years. As developing rapidly, synthetic biology makes bacterial computing possible and great potential. Programming Escherichia coli, the simplest model organism to implement these kinds of basic problems is very necessary. It will bring up with a brand new bio-computing method with better computational complexity. Here, we will design a series of genetic circuits in Escherichia coli to solve the SPP in a directed graph. The nodes and arrows are programed as well-assigned promoters and transcription factors (TFs) respectively. For each arrow, the promoter of its source node initiates the expression of the TF which induces specifically the promoter of the target node. The paths in the graph are described by the transcriptional regulatory cascades. The promoter of destination node in SPP is followed by a green fluorescent protein (GFP) as a reporter. The temporal ordering of the fluorescent protein expression in E.coli reflects the distance difference among varied paths. According theoretical analysis, we can find the the shortest path consisted by all those arrows with linear computational complexity. ReferencesiGEM teams are encouraged to record references you use during the course of your research. They should be posted somewhere on your wiki so that judges and other visitors can see how you though about your project and what works inspired you. |
You can use these subtopics to further explain your project
It's important for teams to describe all the creativity that goes into an iGEM project, along with all the great ideas your team will come up with over the course of your work. It's also important to clearly describe your achievements so that judges will know what you tried to do and where you succeeded. Please write your project page such that what you achieved is easy to distinguish from what you attempted. |