Line 121: | Line 121: | ||
padding-right: 150px; | padding-right: 150px; | ||
font-family:"Open Sans" !important; | font-family:"Open Sans" !important; | ||
− | font-size: | + | font-size: 26px; |
− | color: | + | color: white !important; |
font-weight: 300 !important; | font-weight: 300 !important; | ||
line-height: 30px !important; | line-height: 30px !important; | ||
box-shadow: inset 0px 15px 15px -15px #222222; | box-shadow: inset 0px 15px 15px -15px #222222; | ||
− | background-color: | + | background-color: transparent; |
} | } | ||
#Software-content h1 { | #Software-content h1 { | ||
− | font-size: | + | font-size: 50px; |
+ | color: cyan; | ||
} | } | ||
#Software-content p { | #Software-content p { | ||
Line 135: | Line 136: | ||
text-align:justify; | text-align:justify; | ||
text-justify:inter-ideograph; | text-justify:inter-ideograph; | ||
− | font-size: | + | font-size: 26px!important; |
} | } | ||
ul.slides { | ul.slides { | ||
Line 318: | Line 319: | ||
<p class="meta"> | <p class="meta"> | ||
<span class="cat"><a href="https://2018.igem.org/Team:NEFU_China/Software3">Software 1:</a></span> | <span class="cat"><a href="https://2018.igem.org/Team:NEFU_China/Software3">Software 1:</a></span> | ||
− | <span class="date"> | + | <span class="date">Coding</span> |
</p> | </p> | ||
− | <h1> | + | <h1>Build Coding Book.</h1> |
− | <h1> | + | <h1>By using DFS(Depth First Search) algorithm and optimization arithmetic, we find out the correspondence between letters and codons.</h1> |
</div> | </div> | ||
</div> | </div> | ||
Line 338: | Line 339: | ||
<p class="meta"> | <p class="meta"> | ||
<span class="cat"><a href="https://2018.igem.org/Team:NEFU_China/Software2">Software 2:</a></span> | <span class="cat"><a href="https://2018.igem.org/Team:NEFU_China/Software2">Software 2:</a></span> | ||
− | <span class="date"> | + | <span class="date">Misleading</span> |
</p> | </p> | ||
− | <h1> | + | <h1>Enhance password security.</h1> |
− | <h1> | + | <h1>We added random sequences, introns, and enzymes to the codon sequences so that the intercepted codon information would not be easily decoded.</h1> |
</div> | </div> | ||
</div> | </div> | ||
Line 358: | Line 359: | ||
<p class="meta"> | <p class="meta"> | ||
<span class="cat"><a href="https://2018.igem.org/Team:NEFU_China/Software3">Software 3:</a></span> | <span class="cat"><a href="https://2018.igem.org/Team:NEFU_China/Software3">Software 3:</a></span> | ||
− | <span class="date"> | + | <span class="date">English Word Segment</span> |
</p> | </p> | ||
− | <h1> | + | <h1>Segment English Sentences without Spaces.</h1> |
− | <h1> | + | <h1>Firstly, we implement word graph scanning based on prefix tree structure and construct DAG(Directed Acyclic Graph) to obtain all English word segmentation results. Secondly, we use IF-IDF(Term Frequency-Inverse Document Frequency) model and maximum sharding method to obtain the optimal word segmentation results. </h1> |
</div> | </div> | ||
</div> | </div> | ||
Line 375: | Line 376: | ||
<h1>Software</h1> | <h1>Software</h1> | ||
<p> | <p> | ||
− | + | We develop the Encrypt & Decrypt software. By using DFS(Depth First Search) algorithm and optimization arithmetic, we find out the correspondence between letters and codons. The heart of our software is the Misleading module. By adding enzymes and introns to genes, we complicate the sequences and increase the security of our Coding Book. During the decryption period, we use regular expressions to match useless enzymes and introns, eliminating them and converting the rest of codons into letters. What’s more, we write the information of codons and letters into the picture as a qr code and users can scan the qr code to get this information.<br> | |
− | + | We also develop English Word Segmentation software. Firstly, we implement word graph scanning based on prefix tree structure and construct DAG(Directed Acyclic Graph) to obtain all English word segmentation results. Secondly, we use IF-IDF(Term Frequency-Inverse Document Frequency) model and maximum sharding method to obtain the optimal word segmentation results. | |
− | + | ||
− | + | ||
− | + | ||
</p> | </p> | ||
Line 394: | Line 392: | ||
<p class="meta"> | <p class="meta"> | ||
<span class="cat"><a href="https://2018.igem.org/Team:NEFU_China/Software1">Software 1</a></span> | <span class="cat"><a href="https://2018.igem.org/Team:NEFU_China/Software1">Software 1</a></span> | ||
− | <span class="date"> | + | <span class="date">Coding</span> |
</p> | </p> | ||
− | <h2><a href="https://2018.igem.org/Team:NEFU_China/Software1"> | + | <h2><a href="https://2018.igem.org/Team:NEFU_China/Software1">Build Coding Book.</a></h2> |
− | <p> | + | <p>By using DFS(Depth First Search) algorithm and optimization arithmetic, we find out the correspondence between letters and codons.</p> |
</div> | </div> | ||
</div> | </div> | ||
Line 410: | Line 408: | ||
<p class="meta"> | <p class="meta"> | ||
<span class="cat"><a href="https://2018.igem.org/Team:NEFU_China/Software2">Software 2</a></span> | <span class="cat"><a href="https://2018.igem.org/Team:NEFU_China/Software2">Software 2</a></span> | ||
− | <span class="date"> | + | <span class="date">Misleading</span> |
</p> | </p> | ||
− | <h2><a href="https://2018.igem.org/Team:NEFU_China/Software2"> | + | <h2><a href="https://2018.igem.org/Team:NEFU_China/Software2">Enhance password security.</a></h2> |
− | <p> | + | <p>We added random sequences, introns, and enzymes to the codon sequences so that the intercepted codon information would not be easily decoded.</p> |
</div> | </div> | ||
</div> | </div> | ||
Line 426: | Line 424: | ||
<p class="meta"> | <p class="meta"> | ||
<span class="cat"><a href="https://2018.igem.org/Team:NEFU_China/Software3">Software 3</a></span> | <span class="cat"><a href="https://2018.igem.org/Team:NEFU_China/Software3">Software 3</a></span> | ||
− | <span class="date"> | + | <span class="date">English Word Segment</span> |
</p> | </p> | ||
− | <h2><a href="https://2018.igem.org/Team:NEFU_China/Software3"> | + | <h2><a href="https://2018.igem.org/Team:NEFU_China/Software3">Segment English Sentences without Spaces.</a></h2> |
− | <p> | + | <p>Firstly, we implement word graph scanning based on prefix tree structure and construct DAG(Directed Acyclic Graph) to obtain all English word segmentation results. Secondly, we use IF-IDF(Term Frequency-Inverse Document Frequency) model and maximum sharding method to obtain the optimal word segmentation results. </p> |
</div> | </div> | ||
</div> | </div> |
Revision as of 13:17, 15 October 2018
Software
We develop the Encrypt & Decrypt software. By using DFS(Depth First Search) algorithm and optimization arithmetic, we find out the correspondence between letters and codons. The heart of our software is the Misleading module. By adding enzymes and introns to genes, we complicate the sequences and increase the security of our Coding Book. During the decryption period, we use regular expressions to match useless enzymes and introns, eliminating them and converting the rest of codons into letters. What’s more, we write the information of codons and letters into the picture as a qr code and users can scan the qr code to get this information.
We also develop English Word Segmentation software. Firstly, we implement word graph scanning based on prefix tree structure and construct DAG(Directed Acyclic Graph) to obtain all English word segmentation results. Secondly, we use IF-IDF(Term Frequency-Inverse Document Frequency) model and maximum sharding method to obtain the optimal word segmentation results.
Build Coding Book.
By using DFS(Depth First Search) algorithm and optimization arithmetic, we find out the correspondence between letters and codons.
Enhance password security.
We added random sequences, introns, and enzymes to the codon sequences so that the intercepted codon information would not be easily decoded.
Segment English Sentences without Spaces.
Firstly, we implement word graph scanning based on prefix tree structure and construct DAG(Directed Acyclic Graph) to obtain all English word segmentation results. Secondly, we use IF-IDF(Term Frequency-Inverse Document Frequency) model and maximum sharding method to obtain the optimal word segmentation results.