Line 122: | Line 122: | ||
<body> | <body> | ||
<!--menu--> | <!--menu--> | ||
+ | <!--menu--> | ||
+ | |||
<!--menu--> | <!--menu--> | ||
<div id="menu" style="background-color:rgba(0,0,0,0.6)!important"> | <div id="menu" style="background-color:rgba(0,0,0,0.6)!important"> | ||
<li id="nav" style="left: 8%!important; width: 100%!important;">           | <li id="nav" style="left: 8%!important; width: 100%!important;">           | ||
− | + | ||
<ul class="firstmenu" style="float: left"> | <ul class="firstmenu" style="float: left"> | ||
Line 137: | Line 139: | ||
<ul id="sub_02"> | <ul id="sub_02"> | ||
<li><a href="https://2018.igem.org/Team:NEFU_China/Background" target="_self">BACKGROUND</a></li> | <li><a href="https://2018.igem.org/Team:NEFU_China/Background" target="_self">BACKGROUND</a></li> | ||
− | <li><a href="https://2018.igem.org/Team:NEFU_China/Description" target="_self">DESCRIPTION | + | <li><a href="https://2018.igem.org/Team:NEFU_China/Description" target="_self">DESCRIPTION & DESIGN</a></li> |
− | + | ||
<li><a href="https://2018.igem.org/Team:NEFU_China/Coding book" target="_self">CODE BOOK</a></li> | <li><a href="https://2018.igem.org/Team:NEFU_China/Coding book" target="_self">CODE BOOK</a></li> | ||
</ul> | </ul> | ||
</li> | </li> | ||
− | |||
− | |||
<li class="mainlevel" id="mainlevel_03"> | <li class="mainlevel" id="mainlevel_03"> | ||
− | <a href="https://2018.igem.org/Team:NEFU_China/Demonstrate"><img id="parts" src="https://static.igem.org/mediawiki/2018/6/62/T--NEFU_China--_RESULTS.png"> | + | <a href="https://2018.igem.org/Team:NEFU_China/Demonstrate"><img id="parts" src="https://static.igem.org/mediawiki/2018/6/62/T--NEFU_China--_RESULTS.png">EXPERIMENTS</a> |
<ul id="sub_03"> | <ul id="sub_03"> | ||
<li><a href="https://2018.igem.org/Team:NEFU_China/Lock_Key" target="_self">LOCK & KEY</a></li> | <li><a href="https://2018.igem.org/Team:NEFU_China/Lock_Key" target="_self">LOCK & KEY</a></li> | ||
<li><a href="https://2018.igem.org/Team:NEFU_China/Suicide" target="_self">INFORMATION DESTROYED</a></li> | <li><a href="https://2018.igem.org/Team:NEFU_China/Suicide" target="_self">INFORMATION DESTROYED</a></li> | ||
− | <li><a href="https://2018.igem.org/Team:NEFU_China/Splicing" target="_self">Pre- | + | <li><a href="https://2018.igem.org/Team:NEFU_China/Splicing" target="_self">Pre-RNA SPLICING</a></li> |
<li><a href="https://2018.igem.org/Team:NEFU_China/Demonstrate" target="_self">DEMONSTRATE</a></li> | <li><a href="https://2018.igem.org/Team:NEFU_China/Demonstrate" target="_self">DEMONSTRATE</a></li> | ||
<hr> | <hr> | ||
Line 167: | Line 166: | ||
<li><a href="https://2018.igem.org/Team:NEFU_China/Model" target="_self">OVERVIEW</a></li> | <li><a href="https://2018.igem.org/Team:NEFU_China/Model" target="_self">OVERVIEW</a></li> | ||
<li><a href="https://2018.igem.org/Team:NEFU_China/Model1" target="_self">CORRESPONDING COEFFICIENT</a></li> | <li><a href="https://2018.igem.org/Team:NEFU_China/Model1" target="_self">CORRESPONDING COEFFICIENT</a></li> | ||
− | <li><a href="https://2018.igem.org/Team:NEFU_China/Model2" target="_self"> | + | <li><a href="https://2018.igem.org/Team:NEFU_China/Model2" target="_self">KILLING MODEL</a></li> |
</ul> | </ul> | ||
</li> | </li> | ||
Line 184: | Line 183: | ||
<li><a href="https://2018.igem.org/Team:NEFU_China/Attributions" target="_self">ATTRIBUTIONS</a></li> | <li><a href="https://2018.igem.org/Team:NEFU_China/Attributions" target="_self">ATTRIBUTIONS</a></li> | ||
<li><a href="https://2018.igem.org/Team:NEFU_China/Members" target="_self">MEMBERS</a></li> | <li><a href="https://2018.igem.org/Team:NEFU_China/Members" target="_self">MEMBERS</a></li> | ||
− | |||
− | |||
</ul> | </ul> | ||
</li> | </li> | ||
Line 191: | Line 188: | ||
<a href="https://2018.igem.org/Team:NEFU_China/Human_Practices"><img id="humanpractice" src="https://static.igem.org/mediawiki/2018/9/91/T--NEFU_China--_HUMANPRACTICE.png">HUMAN PRACTICE</a> | <a href="https://2018.igem.org/Team:NEFU_China/Human_Practices"><img id="humanpractice" src="https://static.igem.org/mediawiki/2018/9/91/T--NEFU_China--_HUMANPRACTICE.png">HUMAN PRACTICE</a> | ||
<ul id="sub_08"> | <ul id="sub_08"> | ||
+ | <li><a href="https://2018.igem.org/Team:NEFU_China/Human_Practices" target="_self">OVERVIEW</a></li> | ||
<li><a href="https://2018.igem.org/Team:NEFU_China/Gold_integrated" target="_self">GOLD INTEGRATED</a></li> | <li><a href="https://2018.igem.org/Team:NEFU_China/Gold_integrated" target="_self">GOLD INTEGRATED</a></li> | ||
<li><a href="https://2018.igem.org/Team:NEFU_China/Silver" target="_self">SILVER</a></li> | <li><a href="https://2018.igem.org/Team:NEFU_China/Silver" target="_self">SILVER</a></li> |
Revision as of 14:22, 17 October 2018
Code Book
In English text, each letter has a certain frequency. We constructed a list of letter frequencies for each letter. Also, in living organisms, each codon is used with a certain frequency. Based on this relationship between English letters and codons, we find out the correspondence between letters and codons by using DFS (Depth First Search) algorithm and optimization arithmetic.
Create a letter-frequency table and a codon-frequency table
According to the literature, we obtain the information of the frequency of letters and codons.
letter frequency table:
codon frequency table:
Find out the correspondence between letters and codons by using DFS Algorithm
We build up a tree structure where the codons and the frequency of the codons are stored on each node. Then we use the depth-first search algorithm to traverse down from the root node successively, and match condon-frequence with the letter- frequency to obtain the correspondence between letters and codons.
The tree structure is shown as bellow.
Get the optimal solution by using optional algorithm.
In step 2, we get the correspondence between letters and codons. But some letters have multiple corresponding relationships. For example, in figure 1, the letters E and T correspond to codons GAU, GCU, GAA, E and T also correspond to codons GAU, GCU, AUG. What’s more, the letter T can also correspond to codons GAU, GCU, GCA. Therefore, we use the optimal algorithm to determine one of the multiple correspondence.
For example (letter T):
RESULTS
Print the correspondence between letters and codons:
Reference
[1] Pu, Jinyue and Zinkus-Boltz, Julia and Dickinson, Bryan C. (2017) Evolution of a split RNA polymerase as a versatile biosensor platform. Nat Chem Biol 13 , 432-438
[2] Pu, Jinyue and Zinkus-Boltz, Julia and Dickinson, Bryan C. (2017) Evolution of a split RNA polymerase as a versatile biosensor platform. Nat Chem Biol 13 , 432-438
[3] Pu, Jinyue and Zinkus-Boltz, Julia and Dickinson, Bryan C. (2017) Evolution of a split RNA polymerase as a versatile biosensor platform. Nat Chem Biol 13 , 432-438
[4] Pu, Jinyue and Zinkus-Boltz, Julia and Dickinson, Bryan C. (2017) Evolution of a split RNA polymerase as a versatile biosensor platform. Nat Chem Biol 13 , 432-438
[5] Pu, Jinyue and Zinkus-Boltz, Julia and Dickinson, Bryan C. (2017) Evolution of a split RNA polymerase as a versatile biosensor platform. Nat Chem Biol 13 , 432-438
[6] Pu, Jinyue and Zinkus-Boltz, Julia and Dickinson, Bryan C. (2017) Evolution of a split RNA polymerase as a versatile biosensor platform. Nat Chem Biol 13 , 432-438 s