Difference between revisions of "Team:NEFU China/Software"

Line 424: 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">English Word Segment</span>
+
<span class="date">Word Segment</span>
 
 
 
</p>
 
</p>

Revision as of 14:46, 15 October 2018

Software Overview

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.

html5 bootstrap template

Software 1 Coding

Build Coding Book.

By using DFS(Depth First Search) algorithm and optimization arithmetic, we find out the correspondence between letters and codons.

html5 bootstrap template

Software 2 Misleading

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.

html5 bootstrap template

Software 3 Word Segment

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.

Userfull links

Home     Model    Project    Software   

Parts      Teams   Results   Notebook   

Human  Practice

Follow us

facebook     twitter     wehchat
facebook     twitter     wehchat

Contact us

iGEM-NEFU_China2018

Email: hexinglu@nefu.edu.cn

No.26 Hexing Road, Xiangfang
District, Harbin, Heilongjiang
Province 150000