Team:IBB Pune/Project
From 2009.igem.org
(Difference between revisions)
Samitwatve (Talk | contribs) |
Samitwatve (Talk | contribs) |
||
Line 41: | Line 41: | ||
<html><p><span style="font-weight:bold; font-size:150%; color:#6600FF;">Overall project</span></p> | <html><p><span style="font-weight:bold; font-size:150%; color:#6600FF;">Overall project</span></p> | ||
- | < | + | <html> |
+ | |||
+ | <style> | ||
+ | .greybox { | ||
+ | background-color: #F0CA92; | ||
+ | } | ||
+ | </style> | ||
+ | <! -- END of style sheet --> | ||
+ | |||
+ | <table> | ||
+ | <table cellpadding=10px> | ||
+ | <tr> | ||
+ | <td width="1000" height="100%" valign="top" class="greybox"> | ||
+ | <font face="arial" size="2"> | ||
+ | <!-- INSERT GREY BOX TEXT HERE! (formatting: <b>bold</> <i>italic> <h4>header</h4>) --> | ||
+ | |||
+ | <p> | ||
<p><span style="font-weight:bold; font-size:125%; color:#FF6600;">1. Export tag synthesis and inducible export of desired proteins for in vivo simulation of the <a href="https://2009.igem.org/SNOWDRIFT"><u>SNOWDRIFT</u></a> game:</span></a></p> | <p><span style="font-weight:bold; font-size:125%; color:#FF6600;">1. Export tag synthesis and inducible export of desired proteins for in vivo simulation of the <a href="https://2009.igem.org/SNOWDRIFT"><u>SNOWDRIFT</u></a> game:</span></a></p> | ||
Line 52: | Line 68: | ||
<p>Can bacteria be used as mini computational devices?We are going to find this out by testing a system made entirely out of available bio-bricks from the registry with the introduction of two AND gates. | <p>Can bacteria be used as mini computational devices?We are going to find this out by testing a system made entirely out of available bio-bricks from the registry with the introduction of two AND gates. | ||
Our primary goal is to make simple two state Turing machine like a unary adder.We will also be working on the more complicated Turing machines and also on the ways by which we could connect different two state Turing machines in combination. </P> | Our primary goal is to make simple two state Turing machine like a unary adder.We will also be working on the more complicated Turing machines and also on the ways by which we could connect different two state Turing machines in combination. </P> | ||
+ | </p> | ||
+ | |||
+ | </font> | ||
+ | </td> | ||
+ | </table> | ||
+ | |||
+ | </html> | ||
+ | |||
+ | <br> | ||
+ | |||
Revision as of 01:38, 22 October 2009