(33 intermediate revisions by 2 users not shown) | |||
Line 10: | Line 10: | ||
<link href="https://2016.igem.org/Team:UESTC-software/css/template/footer?action=raw&ctype=text/css" rel="stylesheet" type="text/css" /> | <link href="https://2016.igem.org/Team:UESTC-software/css/template/footer?action=raw&ctype=text/css" rel="stylesheet" type="text/css" /> | ||
− | + | ||
− | + | ||
− | + | ||
− | + | ||
− | + | ||
− | + | ||
− | + | ||
− | + | ||
− | + | ||
− | + | ||
− | + | ||
− | + | ||
</head> | </head> | ||
<body> | <body> | ||
+ | <a name="top" id="top"></a> | ||
<header class="header"> | <header class="header"> | ||
<div class="header-content"> | <div class="header-content"> | ||
Line 32: | Line 22: | ||
<li><a href="https://2016.igem.org/Team:UESTC-software/Project?id=0">PROJECT</a> | <li><a href="https://2016.igem.org/Team:UESTC-software/Project?id=0">PROJECT</a> | ||
<ul class="sub-nav"> | <ul class="sub-nav"> | ||
− | <li><a href="https://2016.igem.org/Team:UESTC-software/Description | + | <li><a href="https://2016.igem.org/Team:UESTC-software/Description">Description</a></li> |
− | <li><a href="https://2016.igem.org/Team:UESTC-software/Design | + | <li><a href="https://2016.igem.org/Team:UESTC-software/Design">Design</a></li> |
− | <li><a href="https://2016.igem.org/Team:UESTC-software/Features | + | <li><a href="https://2016.igem.org/Team:UESTC-software/Features">Features</a></li> |
− | <li><a href="https://2016.igem.org/Team:UESTC-software/ | + | <li><a href="https://2016.igem.org/Team:UESTC-software/Model">Modeling</a></li> |
− | <li><a href="https://2016.igem.org/Team:UESTC-software/ | + | |
− | <li><a href="https://2016.igem.org/Team:UESTC-software/ | + | <li class="three-nav"><a href="https://2016.igem.org/Team:UESTC-software/Proof">Proof</a></li> |
− | <li | + | <li class="three-nav"><a href="https://2016.igem.org/Team:UESTC-software/Demonstrate">Results</a></li> |
− | <li class="three-nav"><a href="https://2016.igem.org/Team:UESTC-software/Extra_work | + | <li><a href="https://2016.igem.org/Team:UESTC-software/Future">Future</a></li> |
+ | <li><a href="https://2016.igem.org/Team:UESTC-software/Parts">Parts</a></li> | ||
+ | <li class="three-nav"><a href="https://2016.igem.org/Team:UESTC-software/Extra_work">Extra Work—Bio2048</a></li> | ||
</ul> | </ul> | ||
</li> | </li> | ||
<li><a href="https://2016.igem.org/Team:UESTC-software/Judging?id=1">JUDGING</a> | <li><a href="https://2016.igem.org/Team:UESTC-software/Judging?id=1">JUDGING</a> | ||
<ul class="sub-nav"> | <ul class="sub-nav"> | ||
− | <li><a href="https://2016.igem.org/Team:UESTC-software/Medal_requirements | + | <li><a href="https://2016.igem.org/Team:UESTC-software/Medal_requirements">Medal Requirements</a></li> |
− | <li><a href="https://2016.igem.org/Team:UESTC-software/Safety? | + | <li><a href="https://2016.igem.org/Team:UESTC-software/Safety?">Safety</a></li> |
</ul> | </ul> | ||
</li> | </li> | ||
Line 51: | Line 43: | ||
<ul class="sub-nav"> | <ul class="sub-nav"> | ||
<li><a href="https://2016.igem.org/Team:UESTC-software/Members?id=2&index=0">Team</a></li> | <li><a href="https://2016.igem.org/Team:UESTC-software/Members?id=2&index=0">Team</a></li> | ||
− | <li><a href="https://2016.igem.org/Team:UESTC-software/ | + | <li><a href="https://2016.igem.org/Team:UESTC-software/Collaborations">Collaborations</a></li> |
− | <li><a href="https://2016.igem.org/Team:UESTC-software/Notebooks | + | <li><a href="https://2016.igem.org/Team:UESTC-software/Notebooks">Notebooks</a></li> |
</ul> | </ul> | ||
</li> | </li> | ||
− | <li><a href="https://2016.igem.org/Team:UESTC-software/ | + | <li><a href="https://2016.igem.org/Team:UESTC-software/HP">HUMAN PRACTICES</a> |
− | + | <ul class="sub-nav"> | |
− | <li><a href="https://2016.igem.org/Team:UESTC-software/ | + | <li><a href="https://2016.igem.org/Team:UESTC-software/HP/Silver">Silver</a></li> |
+ | <li><a href="https://2016.igem.org/Team:UESTC-software/HP/Gold">Gold</a></li> | ||
+ | |||
+ | <li><a href="https://2016.igem.org/Team:UESTC-software/Integrated_Practices">Integrated Practices</a></li> | ||
+ | <li><a href="https://2016.igem.org/Team:UESTC-software/Engagement">Engagement</a></li> | ||
+ | </ul> | ||
+ | </li> | ||
+ | <li><a href="https://2016.igem.org/Team:UESTC-software/Document">DOCUMENTS</a></li> | ||
+ | |||
+ | <li><a href="https://2016.igem.org/Team:UESTC-software/Attributions">ATTRIBUTIONS</a></li> | ||
</ul> | </ul> | ||
</nav> | </nav> | ||
Line 63: | Line 64: | ||
</header> | </header> | ||
<div class="content-top"> | <div class="content-top"> | ||
− | <img src="https://static.igem.org/mediawiki/2016/ | + | <img src="https://static.igem.org/mediawiki/2016/4/48/UESTC-Software-proof-b.png"> |
<p class="title">Proof</p> | <p class="title">Proof</p> | ||
</div> | </div> | ||
<div class="detail-content"> | <div class="detail-content"> | ||
+ | <p>Bio101 has been tested internally and externally by us with some help from our collaborators. </p> | ||
+ | <h2 id="Dry-lab testing">Dry-lab testing</h2> | ||
+ | |||
+ | <p>To examine the usability and stability of the software Bio101, we designed the software testing model. We tested different kinds of errors (deletion, insert and substitute) and error distribution has also been concerned (discrete or successive). </p> | ||
+ | <strong>Fault tolerance</strong> | ||
+ | <p>We choose n files and have large files (>1M) and small files (<1M) distributing on 1:1. And we recognize a successive error, which is more than 5% of the sequences length, is successive type. The other is discrete type. Especially when we test one type of the distributions we consider all kinds of errors, [i.e.] deletion, insertion and replacement. For example, when we test the discrete type, we have discrete deletion, discrete insert and discrete substitution equally, and then calculate the success encoding rate. The test of successive distribution is the same.</p> | ||
+ | <p>Here we list the result:</p> | ||
+ | |||
+ | <p class="img-p" style="font-size:13px;"><img src="https://static.igem.org/mediawiki/2016/0/08/Uestc-software-test1.png"/><br/><B>Tab.1.</B>Discrete distribution.</p> | ||
+ | <p class="img-p" style="font-size:13px;"><img src="https://static.igem.org/mediawiki/2016/6/66/Uestc-software-test2.png"/><br/><B>Tab.2.</B>Successive distribution.</p> | ||
+ | <p style="text-align:right;font-size:13px;">* √: successful ×: failed</p> | ||
+ | |||
+ | |||
+ | <p class="img-p" style="font-size:13px; width:70%; margin-left:150px;"><img src="https://static.igem.org/mediawiki/2016/6/69/Uestc-software-proof-1.png"/><br/><B>Fig.1.</B>The percentage of different distributions of error.</p> | ||
+ | <p class="img-p" style="font-size:13px;"><img src="https://static.igem.org/mediawiki/2016/f/f2/Uestc-software-test7.png"/><br/><B>Fig.2.</B>The percentage of different types of error</p> | ||
+ | <p>The conclusion is that the fault tolerance of discrete distribution is better than that of successive distribution. And the success encoding rate of insert errors is higher than the other two kinds.</p> | ||
+ | <strong>Randomness</strong> | ||
+ | <p>We should produce sequences with sufficient random distributed A, T, C and G. And we recognize the successive number of the same bases as the standard to test the randomness. The distributions of A, G, C, T and higher-order combinations of the nucleotides are similar and homopolymers are rare. In consideration of biological safety, we also use massive data to test limit of homopolymers and the most of the longest competitive bases. Here are parts of our testing results.</p> | ||
+ | <p class="img-p" style="font-size:13px;"><img src="https://static.igem.org/mediawiki/2016/2/29/Uestc-software-proof-3.png | ||
+ | "/></br><B>Fig.3.</B>The distribution of three repeated bases</p> | ||
+ | <p class="img-p" style="font-size:13px;"><img src="https://static.igem.org/mediawiki/2016/a/ab/Uestc-software-proof-4.png"/></br><B>Fig.4.</B>The distribution of four repeated bases</p> | ||
+ | <p class="img-p" style="font-size:13px; width:120%; margin-left:-80px;"><img src="https://static.igem.org/mediawiki/2016/0/07/Uestc-software-proof-5.png"/></br><B>Fig.5.</B>The distribution of the longest repeated bases</p> | ||
+ | |||
+ | |||
+ | <h2 id="Wet-lab validation">Wet-lab validation</h2> | ||
+ | <p>To confirm our workflow’s feasibility, we went through the whole process of DNA information storage.</p> | ||
+ | <p>We used our software to encode a file and the DNA sequences were synthesized by a specialized company (General Biosystems Company, Anhui, China). After a week’s storage, we took out the sample for sequencing. In order to improve the accuracy of sequencing, we used PCR amplification and high-throughput sequencing to accomplish our work. With regard to the sample, we used PCR amplification to generate more sequences at first, then used E. coli to copy the sequences for high-throughput sequencing. Finally, Bio101 was used to decode the DNA sequences. As a result, we recovered our original file.</p> | ||
+ | <p class="img-p" style="font-size:13px;"><img src="https://static.igem.org/mediawiki/2016/f/f9/Uestc_software-test-7.jpg"/></br><B>Fig.6.</B>Wet lab validation flow chart.</p> | ||
+ | <p class="img-p" style="font-size:13px;"><img src="https://static.igem.org/mediawiki/2016/2/24/Uestc_software-test-8.jpg"/></br><B>Fig.7.</B>Plasmids transformation.</p> | ||
+ | <p class="img-p" style="font-size:13px;"><img src="https://static.igem.org/mediawiki/2016/b/b9/Uestc_software-nndn-4.jpg"/></p> | ||
+ | <p class="img-p" style="font-size:13px;"><img src="https://static.igem.org/mediawiki/2016/c/c2/Uestc_software-njik-4.jpg"/></br><B>Fig.8.</B>The sample DNA we synthesized.</p> | ||
+ | <p>As all these we test Bio101, we have the conclusion that our software has great usability and stability. There may be some unexpected situations happening when users encode the file, you can contact us to solve the problem through our iGEM wiki. We desire to develop Bio101 with all our users and we are looking for your feedback!</p> | ||
+ | |||
+ | |||
+ | |||
</div> | </div> | ||
<footer class="footer"> | <footer class="footer"> | ||
<div class="footer-top"> | <div class="footer-top"> | ||
<p>FOLLOW US: | <p>FOLLOW US: | ||
− | <a href="https://github.com/ | + | <a href="https://github.com/igemsoftware2016/UESTC-Software-2016" target="_blank"><img src="https://static.igem.org/mediawiki/igem.org/0/06/Uestc_software-github.png" /></a> |
<a href="http://www.uestc.edu.cn/" target="_blank"><img src="https://static.igem.org/mediawiki/igem.org/a/a4/Uestc_software-school.png" /></a> | <a href="http://www.uestc.edu.cn/" target="_blank"><img src="https://static.igem.org/mediawiki/igem.org/a/a4/Uestc_software-school.png" /></a> | ||
<a href="http://weibo.com/u/5621240588?refer_flag=1001030101_&is_hot=1" target="_blank"><img src="https://static.igem.org/mediawiki/igem.org/b/b1/Uestc_software-weibo.png" /></a> | <a href="http://weibo.com/u/5621240588?refer_flag=1001030101_&is_hot=1" target="_blank"><img src="https://static.igem.org/mediawiki/igem.org/b/b1/Uestc_software-weibo.png" /></a> | ||
Line 88: | Line 124: | ||
<div class="title"><img src="https://static.igem.org/mediawiki/igem.org/e/e3/Uestc_software-reduce.gif" />CATALOGUE</div> | <div class="title"><img src="https://static.igem.org/mediawiki/igem.org/e/e3/Uestc_software-reduce.gif" />CATALOGUE</div> | ||
<ul> | <ul> | ||
+ | <li> | ||
+ | <a href="#Dry-lab testing"> | ||
+ | <span></span> | ||
+ | Dry-lab testing | ||
+ | </a> | ||
+ | </li> | ||
+ | <li> | ||
+ | <a href="#Wet-lab validation"> | ||
+ | <span></span> | ||
+ | Wet-lab validation | ||
+ | </a> | ||
+ | </li> | ||
</ul> | </ul> | ||
</div> | </div> | ||
<script type="text/javascript" src="https://2016.igem.org/Team:UESTC-software/js/basic/jquery?action=raw&ctype=text/javascript"></script> | <script type="text/javascript" src="https://2016.igem.org/Team:UESTC-software/js/basic/jquery?action=raw&ctype=text/javascript"></script> | ||
− | |||
− | |||
− | |||
− | |||
− | + | <script type="text/javascript"> | |
− | + | ||
− | + | ||
− | + | ||
− | + | ||
− | + | ||
− | + | ||
− | + | ||
− | + | ||
− | + | ||
− | + | ||
$(".scroll-top img").addClass("active"); | $(".scroll-top img").addClass("active"); |
Latest revision as of 01:41, 20 October 2016
Proof
Bio101 has been tested internally and externally by us with some help from our collaborators.
Dry-lab testing
To examine the usability and stability of the software Bio101, we designed the software testing model. We tested different kinds of errors (deletion, insert and substitute) and error distribution has also been concerned (discrete or successive).
Fault toleranceWe choose n files and have large files (>1M) and small files (<1M) distributing on 1:1. And we recognize a successive error, which is more than 5% of the sequences length, is successive type. The other is discrete type. Especially when we test one type of the distributions we consider all kinds of errors, [i.e.] deletion, insertion and replacement. For example, when we test the discrete type, we have discrete deletion, discrete insert and discrete substitution equally, and then calculate the success encoding rate. The test of successive distribution is the same.
Here we list the result:
Tab.1.Discrete distribution.
Tab.2.Successive distribution.
* √: successful ×: failed
Fig.1.The percentage of different distributions of error.
Fig.2.The percentage of different types of error
The conclusion is that the fault tolerance of discrete distribution is better than that of successive distribution. And the success encoding rate of insert errors is higher than the other two kinds.
RandomnessWe should produce sequences with sufficient random distributed A, T, C and G. And we recognize the successive number of the same bases as the standard to test the randomness. The distributions of A, G, C, T and higher-order combinations of the nucleotides are similar and homopolymers are rare. In consideration of biological safety, we also use massive data to test limit of homopolymers and the most of the longest competitive bases. Here are parts of our testing results.
Fig.3.The distribution of three repeated bases
Fig.4.The distribution of four repeated bases
Fig.5.The distribution of the longest repeated bases
Wet-lab validation
To confirm our workflow’s feasibility, we went through the whole process of DNA information storage.
We used our software to encode a file and the DNA sequences were synthesized by a specialized company (General Biosystems Company, Anhui, China). After a week’s storage, we took out the sample for sequencing. In order to improve the accuracy of sequencing, we used PCR amplification and high-throughput sequencing to accomplish our work. With regard to the sample, we used PCR amplification to generate more sequences at first, then used E. coli to copy the sequences for high-throughput sequencing. Finally, Bio101 was used to decode the DNA sequences. As a result, we recovered our original file.
Fig.6.Wet lab validation flow chart.
Fig.7.Plasmids transformation.
Fig.8.The sample DNA we synthesized.
As all these we test Bio101, we have the conclusion that our software has great usability and stability. There may be some unexpected situations happening when users encode the file, you can contact us to solve the problem through our iGEM wiki. We desire to develop Bio101 with all our users and we are looking for your feedback!