Team:Sweden/Project
From 2009.igem.org
(18 intermediate revisions not shown) | |||
Line 14: | Line 14: | ||
</head> | </head> | ||
</html> | </html> | ||
- | [[Image: | + | [[Image:JUST.jpg|center|970px]] |
{|style="background-color:#0000A0;" cellpadding="6" cellspacing="1" border="2" width="100%" align="center" | {|style="background-color:#0000A0;" cellpadding="6" cellspacing="1" border="2" width="100%" align="center" | ||
!"align="center"|[[Team:Sweden|<font color="gold">Home</font>]] | !"align="center"|[[Team:Sweden|<font color="gold">Home</font>]] | ||
Line 22: | Line 22: | ||
!align="center"|[[Team:Sweden/Logbook|<font color="gold">Logbook</font>]] | !align="center"|[[Team:Sweden/Logbook|<font color="gold">Logbook</font>]] | ||
!align="center"|[[Team:Sweden/Result|<font color="gold">Result</font>]] | !align="center"|[[Team:Sweden/Result|<font color="gold">Result</font>]] | ||
- | |||
!align="center"|[[Team:Sweden/Sponsors|<font color="gold">Sponsors</font>]] | !align="center"|[[Team:Sweden/Sponsors|<font color="gold">Sponsors</font>]] | ||
|} | |} | ||
+ | <div style="text-align:justify"> | ||
- | == Project == | + | == <font color="blue">Project</font> == |
Line 36: | Line 36: | ||
---- | ---- | ||
- | <font color="blue">We want to implement | + | <font color="blue">We want to implement an automaton in the E-Coli cell. It is based on a few simple grammer rules on how to parse a simple sentence like<br>'''The little girl plays ball''' or '''Boys stroke the little dog'''.<br>These simple rules are : |
+ | <ul type="disc"> | ||
+ | <li>S --> NP VP | ||
+ | <li>NP --> (det) (adj) N | ||
+ | <li>VP --> V (NP) | ||
+ | </ul> | ||
+ | <font color="blue">We target only the parts of speech (POS) tags which in these above grammars are:<br> | ||
+ | <ul type="disc"> | ||
+ | <li> NP:Noun Phrase VP: Verb Phrase | ||
+ | <li>(det:Determiner) (adj:adjective) N: Noun | ||
+ | <li>VP:Verb Phrase V:Verb NP:Noun Phrase | ||
+ | </ul> | ||
+ | <font color="blue">This way the grammar can be implemented as a finite state automaton (FSA) and not as a push-down automaton. | ||
- | + | <font color="blue">A finite state automation is a 5-tupel A = (Q, Σ, δ, s0, F), where Q is a finite set of states, Σ is the finite set of input symbols (alphabet), δ is the transition function, δ: Q × Σ -> Q, s0 is the start state and F is the set of final/accepting states.</font> | |
- | + | ||
- | + | ||
- | + | ==<font color="blue">Our Aim</font>== | |
- | + | <font color="blue">The sentence in our project is a string of different reagents which will be introduced to the cell one by one. As soon as a wrong input is detected the cell will light up red. A sentence is finished by a stop reagent and then the cell will light up green. </font> | |
- | The sentence is a string of different reagents which will be introduced to the cell one by one. As soon as a wrong input is detected the cell will light up red. A sentence is finished by a stop reagent and then the cell will light up green. </font> | + | |
---- | ---- | ||
+ | |bordercolor="gold" bgcolor="gold"| | ||
+ | <font color="blue">The image represents an automaton that show how state transition occurs in a particular sentence parsing automaton</font> | ||
+ | [[Image:teamsweden_state.png|580px|right| ]]<br><br><br> | ||
+ | |- | ||
+ | |bordercolor="gold" bgcolor="gold"| | ||
- | |[[Image: | + | ==<font color="blue">Safety issues</font>== |
+ | \ | ||
+ | <font color="blue">We suggest our plasmid using a current Biobrick in the bank and no new bio bricks are suggested or built. So no safety issue is raised so far.</font> | ||
+ | |||
+ | |bordercolor="gold" bgcolor="gold"| | ||
+ | [[Image:Igem_modified.gif|180px|center| ]] |
Latest revision as of 11:43, 21 October 2009
Home | Team | Project | Mathematical Modelling | Logbook | Result | Sponsors |
---|
Project
We want to implement an automaton in the E-Coli cell. It is based on a few simple grammer rules on how to parse a simple sentence like
We target only the parts of speech (POS) tags which in these above grammars are:
This way the grammar can be implemented as a finite state automaton (FSA) and not as a push-down automaton. A finite state automation is a 5-tupel A = (Q, Σ, δ, s0, F), where Q is a finite set of states, Σ is the finite set of input symbols (alphabet), δ is the transition function, δ: Q × Σ -> Q, s0 is the start state and F is the set of final/accepting states. Our AimThe sentence in our project is a string of different reagents which will be introduced to the cell one by one. As soon as a wrong input is detected the cell will light up red. A sentence is finished by a stop reagent and then the cell will light up green. |
The image represents an automaton that show how state transition occurs in a particular sentence parsing automaton |
Safety issues\ We suggest our plasmid using a current Biobrick in the bank and no new bio bricks are suggested or built. So no safety issue is raised so far. |
|