Team:Sweden/Project

From 2009.igem.org

(Difference between revisions)
(Project)
 
(4 intermediate revisions not shown)
Line 14: Line 14:
</head>
</head>
</html>
</html>
-
[[Image:Header_change.jpg|center|970px]]
+
[[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 26: Line 26:
|}
|}
 +
<div style="text-align:justify">
== <font color="blue">Project</font> ==
== <font color="blue">Project</font> ==
Line 41: Line 42:
  <li>VP -->  V (NP)
  <li>VP -->  V (NP)
</ul>
</ul>
-
We target only the parts of speech (POS) tags which in these above grammars are:<br>
+
<font color="blue">We target only the parts of speech (POS) tags which in these above grammars are:<br>
<ul type="disc">
<ul type="disc">
  <li> NP:Noun Phrase VP: Verb Phrase
  <li> NP:Noun Phrase VP: Verb Phrase
-
<li>(det:Determinant) (adj:adjective) N: Noun
+
<li>(det:Determiner) (adj:adjective) N: Noun
  <li>VP:Verb Phrase V:Verb NP:Noun Phrase
  <li>VP:Verb Phrase V:Verb NP:Noun Phrase
</ul>
</ul>
-
This way the grammar can be implemented as a finite state automaton (FSA) and not as a push-down automaton.
+
<font color="blue">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.</font>
+
<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">Our Aim</font>==
Line 66: Line 67:
|bordercolor="gold" bgcolor="gold"|
|bordercolor="gold" bgcolor="gold"|
-
[[Image:Igem_modified.jpg|180px|center|  ]]<br><br><br>
+
[[Image:Igem_modified.gif|180px|center|  ]]

Latest revision as of 11:43, 21 October 2009

JUST.jpg
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
The little girl plays ball or Boys stroke the little dog.
These simple rules are :

  • S --> NP VP
  • NP --> (det) (adj) N
  • VP --> V (NP)

We target only the parts of speech (POS) tags which in these above grammars are:

  • NP:Noun Phrase VP: Verb Phrase
  • (det:Determiner) (adj:adjective) N: Noun
  • VP:Verb Phrase V:Verb NP:Noun Phrase

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 Aim

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.


The image represents an automaton that show how state transition occurs in a particular sentence parsing automaton

Teamsweden state.png



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.

Igem modified.gif