|
|
| Line 66: |
Line 66: |
| | </div> | | </div> |
| | <div class="detail-content"> | | <div class="detail-content"> |
| − | <h1 style="font-size:1.4em;">Bio101 software testing </h1> | + | <h2 id="Bio101: Archival mode">Bio101: Archival mode</h2> |
| − | <p>To examine the usability and stability of the software Bio101, we design the software testing model. We test the software in the aspects of errors (deletion, insert and substitute) and the distribution of the errors (discrete or successive). We control the conditions artificially so that we can compare the different situations obviously.</p>
| + | <p class="img-p">< a href="https:// youtu. be/ ssSYqdV4QuA"><img src="https://static.igem.org/mediawiki/2016/ 4/ 41/Uestc-software- results-1.png"/></ a></p> |
| − | <h2 id="Fault tolerance">Fault tolerance</h2>
| + | <h2 id="Bio101: Editable mode">Bio101: Editable mode</h2> |
| − | <strong>The distribution of errors</strong>
| + | <p class="img-p">< a href="https:// youtu. be/ 96FZRP4N6Jg"><img src="https://static.igem.org/mediawiki/2016/ a/ a8/Uestc-software- results-2.png"/></ a></p> |
| − | <p>We choose n files including large files (>1M) and small files (<1M), distributing them on 1:1. </p>
| + | <h2 id="Bio2048: An Android game">Bio2048: An Android game</h2> |
| − | <p>We recognize under the equal errors, successive errors 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. For example, when we test the discrete type, we have discrete deletion, discrete insert and discrete substitution equally, then calculate the successful encoding rate. The test of successive distribution is the same.</p>
| + | <p class="img-p">< a href="https:// youtu.be/ rimWgMN9M18"><img src="https://static.igem.org/mediawiki/2016/ b/ b9/Uestc-software- results-3.png"/></ a></p> |
| − | <p>Here we list the result.</p>
| + | <h2 id="Websites for experience">Websites for experience</h2> |
| − | <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> | + | <ul> |
| − | <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> | + | <li> |
| − | <p style="text-align:right;font-size:13px;">* √: successful ×: failed</p> | + | <a href="http://bio101.uestc.edu.cn/transform/"> |
| − | <p>The conclusion is that the fault tolerance of discrete distribution is better than successive distribution’s.</p>
| + | <span></span> |
| − |
| + | Bio101 (http://bio101.uestc.edu.cn/transform/) |
| − | <p class="img-p" style="font-size:13px;"><img src="https://static.igem.org/mediawiki/2016/0/08/Uestc-software-test3.png"/><br/><B>Fig.1.</B>The result comparison.</p> | + | </a> |
| − | <strong>Error types</strong>
| + | </li> |
| − | <p>In a similar approach, we deal with the files in the same way to test errors one by one. We choose n files including large files (>1M) and small files (<1M), distributing them on 1:1. The following is the result.</p>
| + | <li> |
| − |
| + | <a href="http://sj.qq.com/myapp/detail.htm?apkName=com.mx.igem2048"> |
| − | <p class="img-p" style="font-size:13px;"><img src="https://static.igem.org/mediawiki/2016/ e/ e7/Uestc-software- test4.png"/>< br/> <B>Tab.3.</B>Deletion</p> | + | <span></span> |
| − | <p class="img-p" style="font-size:13px;"><img src="https://static.igem.org/mediawiki/2016/9/98/Uestc-software-test5.png"/><br/><B>Tab.4.</B>Insert</p> | + | Bio2048 (http://sj.qq.com/myapp/detail.htm?apkName=com.mx.igem2048) |
| − | <p class="img-p" style="font-size:13px;"><img src="https://static.igem.org/mediawiki/2016/b/be/Uestc-software-test6.png"/><br/><B>Tab.5.</B>Substitution</p> | + | </a> |
| − | <p style="text-align:right;font-size:13px;">* √: successful ×: failed</p>
| + | </li> |
| − | <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 result of three tests.</p> | + | </ul> |
| − | <h2 id="Randomness">Randomness</h2> | + | |
| − | <p> In consideration of biological safety, we should produce sequences with sufficient random distributed A, T, C, G. We recognize the successive number of the same bases as the standard to test randomness.</p> | + | |
| − | <strong>The percentage of normal length of successive bases & the length of the sequence</strong>
| + | |
| − |
| + | |
| − | <p class="img-p" style="font-size:13px;"><img src="https://static.igem.org/mediawiki/2016/7/7e/Uestc-software-test8.png"/></p>
| + | |
| − | <p class="img-p" style="font-size:13px;"><img src="https://static.igem.org/mediawiki/2016/a/af/Uestc-software-test9.png"/></p>
| + | |
| − | <strong>the longest successive bases & the sequence length</strong>
| + | |
| − | <p class="img-p" style="font-size:13px;"><img src="https://static.igem.org/mediawiki/2016/c/c7/Uestc-software-test10.png"/></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 files, you can contact us to solve the problem through our iGEM wiki. We desire to improve Bio101 with users and we are looking forward your feedback!</p>
| + | |
| − | <p style="text-align:right;font-size:13px;"><a href="https://2016.igem.org/Team:UESTC-software">*Our wiki: https://2016.igem.org/Team:UESTC-software</a></p>
| + | |
| | </div> | | </div> |
| | <footer class="footer"> | | <footer class="footer"> |
| Line 118: |
Line 108: |
| | <ul> | | <ul> |
| | <li> | | <li> |
| − | <a href="#Fault tolerance"> | + | <a href="#Bio101: Archival mode"> |
| | + | <span></span> |
| | + | Bio101: Archival mode |
| | + | </a> |
| | + | </li> |
| | + | <li> |
| | + | <a href="#Bio101: Editable mode"> |
| | + | <span></span> |
| | + | Bio101: Editable mode |
| | + | </a> |
| | + | </li> |
| | + | <li> |
| | + | <a href="#Bio2048: An Android game"> |
| | <span></span> | | <span></span> |
| − | Fault tolerance | + | Bio2048: An Android game |
| | </a> | | </a> |
| | </li> | | </li> |
| | <li> | | <li> |
| − | <a href="#Randomness"> | + | <a href="#Websites for experience"> |
| | <span></span> | | <span></span> |
| − | Randomness | + | Websites for experience |
| | </a> | | </a> |
| | </li> | | </li> |
CATALOGUE