Team:Sweden/Project

From 2009.igem.org

(Difference between revisions)
(→Project)
 
(26 intermediate revisions not shown)
Line 1: Line 1:
-
[[Image:New Header copy.jpg|center|950px]]
+
<html>
-
{|style="color:#0000a0;background-color:#000000;" cellpadding="6" cellspacing="1" border="2" bordercolor="#fff" width="100%" align="center"
+
<head>
-
!align="center"|[[Team:Sweden|Home]]
+
<style type="text/css">
-
!align="center"|[[Team:Sweden/Team|Our Team]]
+
body {
-
!align="center"|[[Team:Sweden/Project|Our Project]]
+
background: #0000A0 url(https://static.igem.org/mediawiki/igem.org/4/48/Test_image.gif) repeat  fixed;
-
!align="center"|[[Team:Sweden/Mathematical Modelling|Mathematical Modelling]]
+
        }
-
!align="center"|[[Team:Sweden/Logbook|Logbook]]
+
#bodyContent {background-color:gold;}
-
!align="center"|[[Team:Sweden/Result|Result]]
+
#content {background-color:gold;}
-
!align="center"|[[Team:Sweden/Parts|Parts]]
+
#footer-box {background-color: #CCCCCC;}
-
!align="center"|[[Team:Sweden/Sponsors|Sponsors]]
+
P {color: #FFCC33;}
 +
 
 +
 
 +
</style>
 +
</head>
 +
</html>
 +
[[Image:JUST.jpg|center|970px]]
 +
{|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/Team|<font color="gold">Team</font>]]
 +
!align="center"|[[Team:Sweden/Project|<font color="gold">Project</font>]]
 +
!align="center"|[[Team:Sweden/Mathematical Modelling|<font color="gold">Mathematical Modelling</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/Sponsors|<font color="gold">Sponsors</font>]]
|}
|}
 +
<div style="text-align:justify">
-
== Project ==
+
== <font color="blue">Project</font> ==
{|align="justify"
{|align="justify"
-
|
+
|bgcolor="gold"|
----
----
-
We want to implement this automaton in the cell. It is based on a few simple rules on how to parse a simple sentence like The little girl plays ball or Boys stroke the little dog. These simple rules are :
+
<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">
-
S   à NP VP
+
<li>S  -->    NP VP
-
NP à (det adj) N
+
<li>NP -->  (det) (adj) N
-
VP à V (NP)
+
<li>VP -->  V (NP)
-
|-
+
</ul>
-
We target only the parts of speech (POS) tags because this way the grammar can be implemented as a finite state automaton (FSA) and not as a push-down automaton.  
+
<font color="blue">We target only the parts of speech (POS) tags which in these above grammars are:<br>
-
A finite state automaton 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 with .   
+
<ul type="disc">
-
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.  
+
<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>
----
----
 +
|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>
-
 
-
|[[Image:teamsweden_state.png|500px|right]]
 
|-
|-
-
|
+
|bordercolor="gold" bgcolor="gold"|
-
''Tell us more about your project.  Give us background.  Use this is the abstract of your project.  Be descriptive but concise (1-2 paragraphs)''
+
-
|[[Image:Team.png|200px|right]]
+
-
|-
+
-
|
+
-
|align="center"|[[Team:Sweden | Team Example 2]]
+
-
|}
+
-
 
+
-
<!--- The Mission, Experiments --->
+
-
 
+
-
{| style="color:#1b2c8a;background-color:#0c6;" cellpadding="3" cellspacing="1" border="1" bordercolor="#fff" width="62%" align="center"
+
-
!align="center"|[[Team:Sweden|Home]]
+
-
!align="center"|[[Team:Sweden/Team|The Team]]
+
-
!align="center"|[[Team:Sweden/Project|The Project]]
+
-
!align="center"|[[Team:Sweden/Parts|Parts Submitted to the Registry]]
+
-
!align="center"|[[Team:Sweden/Modeling|Modeling]]
+
-
!align="center"|[[Team:Sweden/Notebook|Notebook]]
+
-
|}
+
-
(''Or you can choose different headings.  But you must have a team page, a project page, and a notebook page.'')
+
-
 
+
-
== '''Overall project''' ==
+
-
 
+
-
Your abstract
+
-
 
+
-
 
+
-
 
+
-
 
+
-
 
+
-
 
+
-
 
+
-
== Project Details==
+
-
 
+
-
 
+
-
 
+
-
 
+
-
 
+
-
=== Part 2 ===
+
-
 
+
-
 
+
-
 
+
-
 
+
-
 
+
-
=== The Experiments ===
+
-
 
+
-
 
+
-
 
+
-
 
+
-
=== Part 3 ===
+
-
 
+
-
 
+
 +
==<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>
-
== Results ==
+
|bordercolor="gold" bgcolor="gold"|
 +
[[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
Retrieved from "http://2009.igem.org/Team:Sweden/Project"