Team:TUDelft/Lock/Key library

From 2009.igem.org

(Difference between revisions)
(Lock/Key library)
(Lock/Key library)
Line 6: Line 6:
As mentioned in preliminary approaches in the section RNA-based Delay: Biosynthetic AND gate, our design was based on the previous work of Isaacs F. 2004, Berkeley iGEM 2006, Caltech iGEM 2006 and Pekin iGEM 2007.However, we found that these projects were done using a single RBS. The registry of biobricks has several RBS, besides, as a advice from our modeling team, the RBS present in our constructs should be one with low affinity or “weak” in order to avoid leaky problems. Therefore, we constructed an algorithm based in the previous works which allows us to generate pairs of locks and keys for any RBS (in or outside the registry).
As mentioned in preliminary approaches in the section RNA-based Delay: Biosynthetic AND gate, our design was based on the previous work of Isaacs F. 2004, Berkeley iGEM 2006, Caltech iGEM 2006 and Pekin iGEM 2007.However, we found that these projects were done using a single RBS. The registry of biobricks has several RBS, besides, as a advice from our modeling team, the RBS present in our constructs should be one with low affinity or “weak” in order to avoid leaky problems. Therefore, we constructed an algorithm based in the previous works which allows us to generate pairs of locks and keys for any RBS (in or outside the registry).
-
 
*[[Team:TUDelft/Lock/Key library: The plan | Lock/Key library: The plan]]
*[[Team:TUDelft/Lock/Key library: The plan | Lock/Key library: The plan]]

Revision as of 13:18, 16 September 2009

This page is still under construction

Lock/Key library

As mentioned in preliminary approaches in the section RNA-based Delay: Biosynthetic AND gate, our design was based on the previous work of Isaacs F. 2004, Berkeley iGEM 2006, Caltech iGEM 2006 and Pekin iGEM 2007.However, we found that these projects were done using a single RBS. The registry of biobricks has several RBS, besides, as a advice from our modeling team, the RBS present in our constructs should be one with low affinity or “weak” in order to avoid leaky problems. Therefore, we constructed an algorithm based in the previous works which allows us to generate pairs of locks and keys for any RBS (in or outside the registry).

Home