Line 279: | Line 279: | ||
<div id="background-content"> | <div id="background-content"> | ||
− | <h1 style=" | + | <h1 style="font-size: 65px;color: orange!important;height: 84px;">Coding Book</h1> |
<p> | <p> | ||
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.<br> | 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.<br> | ||
Line 288: | Line 288: | ||
<br> | <br> | ||
− | <h1 style=" | + | <h1 style="font-size: 38px;color: yellow!important;">Create a letter-frequency table and a codon-frequency table</h1> |
<p> | <p> | ||
According to the literature, we obtain the information of the frequency of letters and codons. | According to the literature, we obtain the information of the frequency of letters and codons. | ||
Line 301: | Line 301: | ||
<br> | <br> | ||
− | <h1 style=" | + | <h1 style="font-size: 38px;color: orange!important;">Find out the correspondence between letters and codons by using DFS Algorithm</h1> |
<p> | <p> | ||
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.<br> | 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.<br> | ||
Line 311: | Line 311: | ||
<br> | <br> | ||
− | <h1 style=" | + | <h1 style="font-size: 38px;color: orange!important;">Get the optimal solution by using optional algorithm.</h1> |
<p > | <p > | ||
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. <br> | 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. <br> | ||
Line 320: | Line 320: | ||
<br> | <br> | ||
− | <h1 style=" | + | <h1 style="font-size: 65px;color: yellow!important;">RESULTS</h1> |
<p> | <p> | ||
Print the correspondence between letters and codons: | Print the correspondence between letters and codons: | ||
Line 385: | Line 385: | ||
</div> | </div> | ||
<div id="background-reference"> | <div id="background-reference"> | ||
− | <h1 style=" | + | <h1 style="font-size: 65px;color: orange!important;height: 70px;">Reference</h1> |
<p> <a href="#"> [1] Pu, Jinyue and Zinkus-Boltz, Julia and Dickinson, Bryan C. (2017) Evolution of a split RNA polymerase as a versatile biosensor platform. <em><em>Nat Chem Biol 13</em></em> , 432-438 </a> | <p> <a href="#"> [1] Pu, Jinyue and Zinkus-Boltz, Julia and Dickinson, Bryan C. (2017) Evolution of a split RNA polymerase as a versatile biosensor platform. <em><em>Nat Chem Biol 13</em></em> , 432-438 </a> | ||
<br> | <br> |
Revision as of 19:05, 15 October 2018
Coding 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.
这里放表格。
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 in the figure 1.
这里放树状图。
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.
RESULTS
Print the correspondence between letters and codons:
Output:
A 8.12| GUA 2.5 GAC 2.75 ACU 2.83
sum:8.08
B 1.49| CCG 0.42 ACG 1.06
sum:1.48
C 2.71| CGU 1.06 CUA 1.64
sum:2.70
D 4.32| UGU 0.86 UUG 1.56 AUA 1.89
sum:4.31
E 12.02| AAC 2.42 GCU 3.37 GAU 3.99
sum:9.78
F 2.30| CUU 0.86 CCU 1.44
sum:2.30
G 2.03| UCC 0.22 UGC 0.44 AUU 1.36
sum:2.02
H 5.92| GCC 1.17 AGG 1.17 CAU 1.36 UUC 2.22
sum:5.92
I 7.31| GUC 1.69 AUG 2.72 GAA 2.89
sum:7.30
J 0.10| GCU 0.1
sum:0.10
K 0.69| CGA 0.67
sum:0.67
L 3.98| ACC 0.86 UCG 0.94 UUU 2.17
sum:3.97
M 2.61| CGC 0.92 CCA 1.67
sum:2.59
N 6.95| UUA 1.58 CAA 1.72 ACA 1.75 GGU 1.89
sum:6.94
O 7.68| CAG 1.72 UCU 1.94 UGG 1.94 GUG 2.08
sum:7.68
P 1.82| AGC 0.64 AUC 1.17
sum:1.81
Q 0.11| GAA 0.11
sum:0.11
R 6.02| CUG 1.33 CAC 1.33 GAG 1.36 AAU 2.0
sum:6.02
S 6.28| AGU 1.36 GGC 1.47 AGA 1.56 GCG 1.89
sum:6.28
T 9.10| AAA 2.0 GUU 2.28 AAG 2.39 UAC 2.42
sum:9.09
U 2.88| GCA 2.86
sum:2.86
V 1.11| UCA 1.08
sum:1.08
W 2.09| CGG 0.56 CUC 0.75 GGG 0.78
sum:2.09
X 0.17| AUG 0.17
sum:0.17
Y 2.11| CCC 0.92 GGA 1.19
sum:2.11
Z 0.07| GAU 0.07
sum:0.07
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