CAGEN draft - Revision history

Murray: /* Competitive Gene Expression */

2011-04-11T00:57:10Z

Competitive Gene Expression

← Older revision		Revision as of 00:57, 11 April 2011
Line 74:		Line 74:
	== Competitive Gene Expression ==		== Competitive Gene Expression ==

	'''Synopsis:''' This challenge is to engineer a cell that maximizes production of a reporter molecule, while competing for resources with a cell lacking the engineered circuit. Equally- sized inoccula of the engineered strain and the wild-type strain are added to a batch culture and grown to saturation. The winning team has the highest reporter yield~~. This challenge is designed to be conceptually simple, yield a clear winner, and support multiple strategies~~.		'''Synopsis:''' This challenge is to engineer a cell that maximizes production of a reporter molecule, while competing for resources with a cell lacking the engineered circuit. Equally-sized inoccula of the engineered strain and the wild-type strain are added to a batch culture and grown to saturation. The winning team has the highest reporter yield.

	'''Motivation:''' Synthetic biosynthesis of protein and small molecule targets is often limited by genetic instability of engineered strains and competition for resources with non-producing mutants. This is particularly true for valuable but cytotoxic molecules (for example, antibiotics such as carbapenems). Costly fermentation processes might become more reliable if we could engineer strains that i) make more efficient use of resources, or ii) can actively inhibit accumulation of non-producers.		'''Motivation:''' Synthetic biosynthesis of protein and small molecule targets is often limited by genetic instability of engineered strains and competition for resources with non-producing mutants. This is particularly true for valuable but cytotoxic molecules (for example, antibiotics such as carbapenems). Costly fermentation processes might become more reliable if we could engineer strains that i) make more efficient use of resources, or ii) can actively inhibit accumulation of non-producers.
Line 80:		Line 80:
	'''Impact:''' This challenge could impact the practice of industrial biotechnology by providing new tools and strategies for maximizing heterologous product yield in batch fermentation. Indirectly, development of these tools would be useful to the broader community of biological engineers interested in genetic stability, control of diverse populations, and circuit design.		'''Impact:''' This challenge could impact the practice of industrial biotechnology by providing new tools and strategies for maximizing heterologous product yield in batch fermentation. Indirectly, development of these tools would be useful to the broader community of biological engineers interested in genetic stability, control of diverse populations, and circuit design.

	'''Metric(s):''' The product will be fixed for a given edition of the challenge~~. A~~ reporter ~~protein or amino acid that can~~ be ~~produced in a wide variety of model organisms would be appropriate for the first edition~~. In subsequent editions, the product could have greater significance or level of public recognition (e.g. a flu drug). Product yield across three replicate batch flasks ~~would~~ be measured for each group, ~~possibly~~ normalized to some limiting nutrient. The overall winner will be determined by a jury consisting of the CAGEN steering committee, based on the highest yield. The jury may award additional prizes for novel mechanisms.		'''Metric(s):''' The product will be fixed for a given edition of the challenge; for the 2011-2012 CAGEN challenge, the reporter molecule will be GFP. (In subsequent editions, the product could have greater significance or level of public recognition [e.g. a flu drug].) Product yield across three replicate batch flasks will be measured for each group, normalized to some limiting nutrient. The overall winner will be determined by a jury consisting of the CAGEN steering committee, based on the highest yield. The jury may award additional prizes for novel mechanisms.

Murray: /* Universal Logic Gates */

2011-04-11T00:54:00Z

Universal Logic Gates

← Older revision		Revision as of 00:54, 11 April 2011
Line 41:		Line 41:
	'''Impact:''' The availability of truly scalable logic gates will enable the construction of multiple complex circuits which can be linked together in a modular fashion. This would provide a basic framework for the the construction of complex synthetic devices such as biological counters and sensors which can give a defined output based on a combination of complex inputs. Applications would be diverse, including basic biology, medicine, environmental science, and agriculture.		'''Impact:''' The availability of truly scalable logic gates will enable the construction of multiple complex circuits which can be linked together in a modular fashion. This would provide a basic framework for the the construction of complex synthetic devices such as biological counters and sensors which can give a defined output based on a combination of complex inputs. Applications would be diverse, including basic biology, medicine, environmental science, and agriculture.

	'''Metric:''' Competitors should demonstrate the construction of three Boolean logic gates using various combinations of a single universal logic gate~~. Selection of the winner shall be done by a jury consisting of the CAGEN steering committee~~. Entrants will be judged based on:		'''Metric:''' Competitors should demonstrate the construction of three Boolean logic gates using various combinations of a single universal logic gate. Entrants will be judged based on:
	* Switch-like response of device to inputs		* Switch-like response of device to inputs
	* Complexity with regards to the logic statements constructed (i.e. an XNOR gate is more difficult to construct with NAND logic than an OR gate)		* Complexity with regards to the logic statements constructed (i.e. an XNOR gate is more difficult to construct with NAND logic than an OR gate)
	* Parsimony with regards to the number of gates in the circuit (e.g. an optimal OR gate will be made out of 3 NAND gates)		* Parsimony with regards to the number of gates in the circuit (e.g. an optimal OR gate will be made out of 3 NAND gates)
			Selection of the winner shall be done by a jury consisting of the CAGEN steering committee.

	== Robust Synthetic Development ==		== Robust Synthetic Development ==

Murray: /* Robust Gene Response */

2011-04-11T00:53:21Z

Robust Gene Response

← Older revision		Revision as of 00:53, 11 April 2011
Line 19:		Line 19:
	== Robust Gene Response ==		== Robust Gene Response ==

	'''Synopsis:''' The goal of this challenge is to design a circuit that can express a fluorescent protein at a controlled level upon the introduction of a chemical inducer, with minimal variation in expression between cells and in multiple contexts. At conditions yielding maximum expression, the circuit should quickly bring the volume-normalized fluorescence from 1X to 10X in response to the addition of an inducer of the designer's choice. The circuit must work at ~~30, 35 and 40 degC in the host organism~~, with minimal variation in the fluorescence over time, operating temperature and cell choice.		'''Synopsis:''' The goal of this challenge is to design a circuit that can express a fluorescent protein at a controlled level upon the introduction of a chemical inducer, with minimal variation in expression between cells and in multiple contexts. At conditions yielding maximum expression, the circuit should quickly bring the volume-normalized fluorescence from 1X to 10X in response to the addition of an inducer of the designer's choice. The circuit must work at multiple temperatures, with minimal variation in the fluorescence over time, operating temperature and cell choice.

	'''Motivation:''' Current synthetic circuits demonstrate large variability in expression level when operating different contexts and this limits the ability of synthetic biologists to build on designs performed by other groups. By designing circuits that demonstrate highly repeatable performance over a range of operating conditions, it will be possible to make better use of designs in a modular fashion.		'''Motivation:''' Current synthetic circuits demonstrate large variability in expression level when operating different contexts and this limits the ability of synthetic biologists to build on designs performed by other groups. By designing circuits that demonstrate highly repeatable performance over a range of operating conditions, it will be possible to make better use of designs in a modular fashion.
Line 25:		Line 25:
	'''Impact:''' Improved understanding engineering processes for synthetic biologists will enable more rapid and pervasive development of synthetic circuits, with applications in materials processing, environmental science, agriculture and and medicine.		'''Impact:''' Improved understanding engineering processes for synthetic biologists will enable more rapid and pervasive development of synthetic circuits, with applications in materials processing, environmental science, agriculture and and medicine.

	'''Metric(s):''' ~~Describe how the most advanced or robust result will be determined each year. An easy-to-quantify metric is preferred.~~		'''Metric(s):''' The winner of this challenge will be determined based on the worst case, mean square error between the ideal step response and the experimental results, with evaluation over multiple temperatures. To be considered, data for the circuit must be submitted for steady state operating temperatures at a nominal value (chosen by the contestant), nominal + 5% and nominal - 5%, with measurements taken in at least 5 individual cells chosen from separate colonies. This represents a set of 15 total time traces of data. At least one of these responses must demonstrate a step response that goes from 1X to 10X expression level in response to the addition of the inducer.
	The winner of this challenge will be determined based on the worst case, mean square error between the ideal step response ~~for a given induction level~~ and the experimental results ~~at that induction level~~, ~~for~~ multiple temperatures ~~and cells~~. To be considered, data for the circuit must be submitted for steady state operating temperatures at a nominal ~~temperature~~ (chosen by the contestant), nominal + 5% and nominal =5%, ~~with at least 5 induction levels spanning minimum to maximum expression at each temperature, and~~ with measurements taken in at least 5 individual cells chosen from separate colonies. This represents a set of 75 total time traces of data.

	The following method will be used to determine the numerical score for each ~~submission~~: let <amsmath>r_i(t)</amsmath> represents the (single) ideal step response at a given induction level i (with minimum and maximum values chosen by the participant), <amsmath>y_i(t)</amsmath> represents the measured fluorescence of a given cell, T1 represents the time at y(t) reaches 5% of its maximum value and T2 represents that point at which it reaches 95%. Each run will be scored according to the formula:		The following method will be used to determine the numerical score for each time response: let <amsmath>r_i(t)</amsmath> represents the (single) ideal step response at a given induction level i (with minimum and maximum values chosen by the participant), <amsmath>y_i(t)</amsmath> represents the measured fluorescence of a given cell, T1 represents the time at y(t) reaches 5% of its maximum value and T2 represents that point at which it reaches 95%. Each run will be scored according to the formula:
	<center><amsmath>		<center><amsmath>
	\text{Score[run]} = \int_{T1}^{T2} \|y_i(t) - r_i(t)\|^2 dt		\text{Score[run]} = \int_{T1}^{T2} \|y_i(t) - r_i(t)\|^2 dt
	</amsmath></center>		</amsmath></center>
	The score for the submitted design will be the worst (highest) value of the score across all runs (75 total). Note that <amsmath>r_i(t)</amsmath> is fixed based on induction level, while <amsmath>y_i(t)</amsmath> depends on the specific run. The participant can specify a single minimum value for <amsmath>r_i(t)</amsmath> and a table of maximum values (one for each induction level).		The score for the submitted design will be the worst (highest) value of the score across all runs (15 total). Note that <amsmath>r_i(t)</amsmath> is fixed based on induction level, while <amsmath>y_i(t)</amsmath> depends on the specific run. The participant can specify a single minimum value for <amsmath>r_i(t)</amsmath> and a table of maximum values (one for each induction level).

	== Universal Logic Gates ==		== Universal Logic Gates ==

Murray: /* Robust Gene Response */

2011-04-11T00:45:37Z

Robust Gene Response

← Older revision		Revision as of 00:45, 11 April 2011
Line 18:		Line 18:

	== Robust Gene Response ==		== Robust Gene Response ==

			'''Synopsis:''' The goal of this challenge is to design a circuit that can express a fluorescent protein at a controlled level upon the introduction of a chemical inducer, with minimal variation in expression between cells and in multiple contexts. At conditions yielding maximum expression, the circuit should quickly bring the volume-normalized fluorescence from 1X to 10X in response to the addition of an inducer of the designer's choice. The circuit must work at 30, 35 and 40 degC in the host organism, with minimal variation in the fluorescence over time, operating temperature and cell choice.

			'''Motivation:''' Current synthetic circuits demonstrate large variability in expression level when operating different contexts and this limits the ability of synthetic biologists to build on designs performed by other groups. By designing circuits that demonstrate highly repeatable performance over a range of operating conditions, it will be possible to make better use of designs in a modular fashion.

			'''Impact:''' Improved understanding engineering processes for synthetic biologists will enable more rapid and pervasive development of synthetic circuits, with applications in materials processing, environmental science, agriculture and and medicine.

			'''Metric(s):''' Describe how the most advanced or robust result will be determined each year. An easy-to-quantify metric is preferred.
			The winner of this challenge will be determined based on the worst case, mean square error between the ideal step response for a given induction level and the experimental results at that induction level, for multiple temperatures and cells. To be considered, data for the circuit must be submitted for steady state operating temperatures at a nominal temperature (chosen by the contestant), nominal + 5% and nominal =5%, with at least 5 induction levels spanning minimum to maximum expression at each temperature, and with measurements taken in at least 5 individual cells chosen from separate colonies. This represents a set of 75 total time traces of data.

			The following method will be used to determine the numerical score for each submission: let <amsmath>r_i(t)</amsmath> represents the (single) ideal step response at a given induction level i (with minimum and maximum values chosen by the participant), <amsmath>y_i(t)</amsmath> represents the measured fluorescence of a given cell, T1 represents the time at y(t) reaches 5% of its maximum value and T2 represents that point at which it reaches 95%. Each run will be scored according to the formula:
			<center><amsmath>
			\text{Score[run]} = \int_{T1}^{T2} \|y_i(t) - r_i(t)\|^2 dt
			</amsmath></center>
			The score for the submitted design will be the worst (highest) value of the score across all runs (75 total). Note that <amsmath>r_i(t)</amsmath> is fixed based on induction level, while <amsmath>y_i(t)</amsmath> depends on the specific run. The participant can specify a single minimum value for <amsmath>r_i(t)</amsmath> and a table of maximum values (one for each induction level).

	== Universal Logic Gates ==		== Universal Logic Gates ==

Murray at 00:40, 11 April 2011

2011-04-11T00:40:52Z

Murray: /* CAGEN Challenge Proposals: 2011-12 */

2011-04-11T00:40:05Z

CAGEN Challenge Proposals: 2011-12

@@ Line 17: / Line 17: @@
 The following challenges have been proposed as possible CAGEN challenges for 2011-12.
-===  Robust synthetic developmental patterning ===
+===  Robust Gene Response ===
 '''Synopsis:''' The goal of this challenge is to design a circuit that can express a fluorescent protein with specific self‐generated spatial patterns. These patterns should ideally emerge without external spatial cues. The two basic patterns we consider are: (1) A circular pattern with a diameter of exactly N cells, where cell are on at the center of the circle and off outside (2) A striped on‐off pattern with a wavelength of exactly N cell diameters. The boundaries formed should exhibit a sharp turn‐on and turn‐off functions on the order of one cell length with minimal errors (no off cells in the on area and vice versa).
@@ Line 40: / Line 55: @@
 A similar scoring method will be applied to the striped pattern.
-The score for the submitted design will be the worst (highest) value of the score across 3 runs corresponding to 3 temperatures: nominal, nominal-5%, nominal+5% (where nominal is chosen by the contestant).
+The score for the submitted design will be the worst (highest) value of the score across 3 runs each at 3 temperatures: nominal, nominal-5%, nominal+5% (where nominal is chosen by the contestant).  Final determination of the winner will be done by a jury consisting of the CAGEN steering committee.

Murray at 00:33, 11 April 2011

2011-04-11T00:33:42Z

← Older revision		Revision as of 00:33, 11 April 2011
Line 1:		Line 1:
			{{righttoc}}
	The Critical Assessment for Genetically Engineered Networks (CAGEN, pronounced "cajun") is a new competition designed to improve the robustness and performance of human-designed biological circuits and devices operating in cells. The competition is intended to bring together leading research groups in biological circuit design to compete to demonstrate their abilities at designing circuits that perform in a prescribed manner in a variety of cellular contexts. Each year, a steering committee will select one or more challenge problems that involves the design of an increasingly complex set of biological functions in a range of environments. Teams must submit their sequences, plasmid DNA implementing their circuit and data characterizing the performance of their system against a specified test suite. The top 3-5 designs will be submitted to the NSF BIOFAB for final characterization, and the winner will be selected based on a set of quantifiable metrics.		The Critical Assessment for Genetically Engineered Networks (CAGEN, pronounced "cajun") is a new competition designed to improve the robustness and performance of human-designed biological circuits and devices operating in cells. The competition is intended to bring together leading research groups in biological circuit design to compete to demonstrate their abilities at designing circuits that perform in a prescribed manner in a variety of cellular contexts. Each year, a steering committee will select one or more challenge problems that involves the design of an increasingly complex set of biological functions in a range of environments. Teams must submit their sequences, plasmid DNA implementing their circuit and data characterizing the performance of their system against a specified test suite. The top 3-5 designs will be submitted to the NSF BIOFAB for final characterization, and the winner will be selected based on a set of quantifiable metrics.

Murray: /* Robust synthetic developmental patterning */

2011-04-11T00:33:16Z

Robust synthetic developmental patterning

← Older revision		Revision as of 00:33, 11 April 2011
Line 18:		Line 18:
	=== Robust synthetic developmental patterning ===		=== Robust synthetic developmental patterning ===

	* '''Synopsis:''' The goal of this challenge is to design a circuit that can express a fluorescent protein with specific self‐generated spatial patterns. These patterns should ideally emerge without external spatial cues. The two basic patterns we consider are: (1) A circular pattern with a diameter of exactly N cells, where cell are on at the center of the circle and off outside (2) A striped on‐off pattern with a wavelength of exactly N cell diameters. The boundaries formed should exhibit a sharp turn‐on and turn‐off functions on the order of one cell length with minimal errors (no off cells in the on area and vice versa).		'''Synopsis:''' The goal of this challenge is to design a circuit that can express a fluorescent protein with specific self‐generated spatial patterns. These patterns should ideally emerge without external spatial cues. The two basic patterns we consider are: (1) A circular pattern with a diameter of exactly N cells, where cell are on at the center of the circle and off outside (2) A striped on‐off pattern with a wavelength of exactly N cell diameters. The boundaries formed should exhibit a sharp turn‐on and turn‐off functions on the order of one cell length with minimal errors (no off cells in the on area and vice versa).
	{\| border=1 width=80% align=center		{\| border=1 width=80% align=center
	\|-		\|-

Murray: /* Robust synthetic developmental patterning */

2011-04-11T00:33:04Z

Robust synthetic developmental patterning

← Older revision		Revision as of 00:33, 11 April 2011
Line 28:		Line 28:
	\|}		\|}

	* '''Motivation:''' Motivation for this challenge is twofold: (1) Current synthetic circuits are limited in their ability to form self emerging spatial patterns in a robust manner. In fact, most current synthetic patterning circuits are driven by external cues. This challenge will likely push forward the technology for developing synthetic circuits based on cell‐cell communication (2) By constructing synthetic circuits exhibiting robust self emerging spatial patterns we can learn about the mechanisms involved in developmental patterning circuits. In particular, such a challenge would help explore the range of possible genetic circuits that can generate multicellular development and their limitations.		'''Motivation:''' Motivation for this challenge is twofold: (1) Current synthetic circuits are limited in their ability to form self emerging spatial patterns in a robust manner. In fact, most current synthetic patterning circuits are driven by external cues. This challenge will likely push forward the technology for developing synthetic circuits based on cell‐cell communication (2) By constructing synthetic circuits exhibiting robust self emerging spatial patterns we can learn about the mechanisms involved in developmental patterning circuits. In particular, such a challenge would help explore the range of possible genetic circuits that can generate multicellular development and their limitations.

	* '''Impact:''' The impact of this challenge is twofold: (1) Improved understanding of basic engineering principles for synthetic biologists will enable more rapid and pervasive development of synthetic circuits, with applications in materials processing, environmental science, agriculture and medicine. (2) The ability to generate self emerging spatial patterns may be important in the field of tissue engineering where precise and accurate patterns of differentiation are required.		'''Impact:''' The impact of this challenge is twofold: (1) Improved understanding of basic engineering principles for synthetic biologists will enable more rapid and pervasive development of synthetic circuits, with applications in materials processing, environmental science, agriculture and medicine. (2) The ability to generate self emerging spatial patterns may be important in the field of tissue engineering where precise and accurate patterns of differentiation are required.

	* '''Metric(s):''' The winner of this challenge will be determined based on the difference between the observed mean spatial response function and an ideal spatial pattern. The ideal pattern for the concentric ring challenge ( #1) is on at a diameter of N (TBD) cells and turns off sharply at beyond that diameter. The ideal pattern for striped pattern challenge (#2) is an on and off patterns with a fixed wavelength of N (TBD) cells. Again, boundaries between on and off states should be sharp.		'''Metric(s):''' The winner of this challenge will be determined based on the difference between the observed mean spatial response function and an ideal spatial pattern. The ideal pattern for the concentric ring challenge ( #1) is on at a diameter of N (TBD) cells and turns off sharply at beyond that diameter. The ideal pattern for striped pattern challenge (#2) is an on and off patterns with a fixed wavelength of N (TBD) cells. Again, boundaries between on and off states should be sharp.
	: The following method will be used to determine the numerical score for each submission: let <amsmath>r_i(x)</amsmath> represent the ideal spatial response curve (for the concentric ring: Fmax for R<RN, 0 for R>RN, where RN represent the diameter of N cells, and Fmax is a maximal fluorescence level (determined by contestant)). Let <amsmath>y_i(x)</amsmath> represent the measured fluorescence of a given cell at steady state (time will be determined by contestant). Each run will be scored according to the formula:		: The following method will be used to determine the numerical score for each submission: let <amsmath>r_i(x)</amsmath> represent the ideal spatial response curve (for the concentric ring: Fmax for R<RN, 0 for R>RN, where RN represent the diameter of N cells, and Fmax is a maximal fluorescence level (determined by contestant)). Let <amsmath>y_i(x)</amsmath> represent the measured fluorescence of a given cell at steady state (time will be determined by contestant). Each run will be scored according to the formula:
	<center><amsmath>		<center><amsmath>
	\text{ Score[run]} = \int_0^\infty \|y_i(x) - r_i(x)\|^2 dx		\text{ Score[run]} = \int_0^\infty \|y_i(x) - r_i(x)\|^2 dx
	</amsmath></center>		</amsmath></center>
	:A similar scoring method will be applied to the striped pattern.		A similar scoring method will be applied to the striped pattern.
	:The score for the submitted design will be the worst (highest) value of the score across 3 runs corresponding to 3 temperatures: nominal, nominal-5%, nominal+5% (where nominal is chosen by the contestant).

	~~Bibliography~~: ~~TBD~~		The score for the submitted design will be the worst (highest) value of the score across 3 runs corresponding to 3 temperatures: nominal, nominal-5%, nominal+5% (where nominal is chosen by the contestant).

Murray: /* Robust synthetic developmental patterning */

2011-04-11T00:32:32Z

Robust synthetic developmental patterning

← Older revision		Revision as of 00:32, 11 April 2011
Line 33:		Line 33:

	* '''Metric(s):''' The winner of this challenge will be determined based on the difference between the observed mean spatial response function and an ideal spatial pattern. The ideal pattern for the concentric ring challenge ( #1) is on at a diameter of N (TBD) cells and turns off sharply at beyond that diameter. The ideal pattern for striped pattern challenge (#2) is an on and off patterns with a fixed wavelength of N (TBD) cells. Again, boundaries between on and off states should be sharp.		* '''Metric(s):''' The winner of this challenge will be determined based on the difference between the observed mean spatial response function and an ideal spatial pattern. The ideal pattern for the concentric ring challenge ( #1) is on at a diameter of N (TBD) cells and turns off sharply at beyond that diameter. The ideal pattern for striped pattern challenge (#2) is an on and off patterns with a fixed wavelength of N (TBD) cells. Again, boundaries between on and off states should be sharp.
	: The following method will be used to determine the numerical score for each submission: let <amsmath>r_i(x)</amsmath> represent the ideal spatial response curve (for the concentric ring: Fmax for R<RN, 0 for R>RN, where RN represent the diameter of N cells, and Fmax is a maximal fluorescence level (determined by contestant)). Let <~~math~~>y_i(x)</~~math~~> represent the measured fluorescence of a given cell at steady state (time will be determined by contestant). Each run will be scored according to the formula:		: The following method will be used to determine the numerical score for each submission: let <amsmath>r_i(x)</amsmath> represent the ideal spatial response curve (for the concentric ring: Fmax for R<RN, 0 for R>RN, where RN represent the diameter of N cells, and Fmax is a maximal fluorescence level (determined by contestant)). Let <amsmath>y_i(x)</amsmath> represent the measured fluorescence of a given cell at steady state (time will be determined by contestant). Each run will be scored according to the formula:
	<center><amsmath>		<center><amsmath>
	\text{ Score[run]} = \int_0^\infty \|y_i(x) ‐ r_i(x)\|^2 dx		\text{ Score[run]} = \int_0^\infty \|y_i(x) - r_i(x)\|^2 dx
	</amsmath></center>		</amsmath></center>
	:A similar scoring method will be applied to the striped pattern.		:A similar scoring method will be applied to the striped pattern.

← Older revision		Revision as of 00:40, 11 April 2011
Line 13:		Line 13:
	## A tie: multiple submissions offer a similar level of improvement on the state of the art.		## A tie: multiple submissions offer a similar level of improvement on the state of the art.

	== CAGEN Challenge Proposals: 2011-12 ==		= CAGEN Challenge Proposals: 2011-12 =

	The following challenges have been proposed as possible CAGEN challenges for 2011-12.		The following challenges have been proposed as possible CAGEN challenges for 2011-12.

	=== Robust Gene Response ===		== Robust Gene Response ==

	=== Universal Logic Gates ===		== Universal Logic Gates ==

	'''Synopsis:''' This challenge requires the demonstration of a scalable and robust NAND (“not and”) or NOR (“not or”) logic gate. Successful designs will allow the use of multiple coupled gates in a cell to compute arbitrarily complex logic. Circuits should employ commonly available inputs (e.g. IPTG) and output a fluorescent signal.		'''Synopsis:''' This challenge requires the demonstration of a scalable and robust NAND (“not and”) or NOR (“not or”) logic gate. Successful designs will allow the use of multiple coupled gates in a cell to compute arbitrarily complex logic. Circuits should employ commonly available inputs (e.g. IPTG) and output a fluorescent signal.
Line 32:		Line 32:
	* Parsimony with regards to the number of gates in the circuit (e.g. an optimal OR gate will be made out of 3 NAND gates)		* Parsimony with regards to the number of gates in the circuit (e.g. an optimal OR gate will be made out of 3 NAND gates)

	=== Robust Synthetic Development ===		== Robust Synthetic Development ==

	'''Synopsis:''' The goal of this challenge is to design a circuit that can express a fluorescent protein with specific self‐generated spatial patterns. These patterns should ideally emerge without external spatial cues. The two basic patterns we consider are: (1) A circular pattern with a diameter of exactly N cells, where cell are on at the center of the circle and off outside (2) A striped on‐off pattern with a wavelength of exactly N cell diameters. The boundaries formed should exhibit a sharp turn‐on and turn‐off functions on the order of one cell length with minimal errors (no off cells in the on area and vice versa).		'''Synopsis:''' The goal of this challenge is to design a circuit that can express a fluorescent protein with specific self‐generated spatial patterns. These patterns should ideally emerge without external spatial cues. The two basic patterns we consider are: (1) A circular pattern with a diameter of exactly N cells, where cell are on at the center of the circle and off outside (2) A striped on‐off pattern with a wavelength of exactly N cell diameters. The boundaries formed should exhibit a sharp turn‐on and turn‐off functions on the order of one cell length with minimal errors (no off cells in the on area and vice versa).
Line 57:		Line 57:
	The score for the submitted design will be the worst (highest) value of the score across 3 runs each at 3 temperatures: nominal, nominal-5%, nominal+5% (where nominal is chosen by the contestant). Final determination of the winner will be done by a jury consisting of the CAGEN steering committee.		The score for the submitted design will be the worst (highest) value of the score across 3 runs each at 3 temperatures: nominal, nominal-5%, nominal+5% (where nominal is chosen by the contestant). Final determination of the winner will be done by a jury consisting of the CAGEN steering committee.

	=== Competitive Gene Expression ===		== Competitive Gene Expression ==

	'''Synopsis:''' This challenge is to engineer a cell that maximizes production of a reporter molecule, while competing for resources with a cell lacking the engineered circuit. Equally- sized inoccula of the engineered strain and the wild-type strain are added to a batch culture and grown to saturation. The winning team has the highest reporter yield. This challenge is designed to be conceptually simple, yield a clear winner, and support multiple strategies.		'''Synopsis:''' This challenge is to engineer a cell that maximizes production of a reporter molecule, while competing for resources with a cell lacking the engineered circuit. Equally- sized inoccula of the engineered strain and the wild-type strain are added to a batch culture and grown to saturation. The winning team has the highest reporter yield. This challenge is designed to be conceptually simple, yield a clear winner, and support multiple strategies.