Team:NUDT CHINA/Notebook

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

In this way, we can cut the RBS and target gene out which means this route does not have line L (we link the 1, 2 (or 1, 3) to keep the circle structure of plasmid). Then we can test this route by the time of arriving at the ending node which reported by the report gene (we used the GFP).

Second stage:

But we found that it was not easy get so many different good restrict enzyme. So we change the design slightly. (Fig. 3)

Fig. 3 the position of two same restrict enzyme sites

In this way, we can still finish the function of first stage but save my restrict enzymes.

Third stage:

The last problem is how to compare the length of different pathway. Firstly, we decide to build all the possible route and test them. That is to say, we need to cut out 1, 2, 3,…,device(s) so that we can test the entire route, which is named exhaustion, quite time-consuming. Later, we found a better way where we can only cut one device which means we only need to build n graph if the graph has n lines.

Provided that we have 5 lines in a graph like Fig. 4.

Fig. 4 a graph of 5 lines, where node 1 is the beginning node 4 is the ending

According our method to find the shortest path, the first step is to build 6 different systems. Then we tested the “finished time” of each systems. Here is the systems and their “finish time”.

System	Array	Time (Theoretically)
11111		2 units
01111		2 units
10111		2 units
11011		2 units
11101		3 units
11110		unreachable

Noticed that without line L5, the ending is inaccessible which implicates the L5 is indispensable. Though it does not block the accessibility, the absence of L4 slows down the arrival, which implies that L4 is on the shortest path. Thus, from the date of the chart above, we can pick out the shortest path is:

Notebook

You should make use of the calendar feature on the wiki and start a lab notebook. This may be looked at by the judges to see how your work progressed throughout the summer. It is a very useful organizational tool as well.