"
Team:Newcastle University/Evolutionary Algorithm
From 2008.igem.org
(Difference between revisions)
(New page: {{:Team:Newcastle University/Header}} ==Evolutionary Algorithm== ===Aim:=== Develop a system that will evolve genetic circuits represented as networks that meet the functional requireme...) |
|||
| Line 1: | Line 1: | ||
{{:Team:Newcastle University/Header}} | {{:Team:Newcastle University/Header}} | ||
| - | + | {{:Team:Newcastle University/Template:UnderTheAim|page-title=[[Team:Newcastle University/Evolutionary Algorithm|Evolutionary Algorithm]]}} | |
==Evolutionary Algorithm== | ==Evolutionary Algorithm== | ||
| Line 10: | Line 10: | ||
===Objectives:=== | ===Objectives:=== | ||
| - | * Reads parts list from [[parts repository]] | + | * Reads parts list from [[Team:Newcastle University/Rarts Repository|parts repository]] |
| - | * Reads constraints on parts assembly (from [[Constraints Repository]]) | + | * Reads constraints on parts assembly (from [[Team:Newcastle University/Constraints Repository|Constraints Repository]]) |
* Evolutionary algorithm assembles part models to a larger model | * Evolutionary algorithm assembles part models to a larger model | ||
* Simulates the behaviour of the composite model | * Simulates the behaviour of the composite model | ||
| - | * Reads desired 'input' behaviour from | + | * Reads desired 'input' behaviour from [[Team:Newcastle University/Workbench|Workbench]] |
* Reads desired 'output' behaviour from workbench | * Reads desired 'output' behaviour from workbench | ||
* Assesses fitness | * Assesses fitness | ||
* Mutates the model | * Mutates the model | ||
| - | * Output the fittest model as CellML (to workbench | + | * Output the fittest model as CellML (to workbench) |
===Contributors:=== | ===Contributors:=== | ||
| - | Lead: [[Mark Wappett]] | + | Lead: [[Team:Newcastle University/Mark Wappett]] |
Revision as of 07:25, 26 August 2008
Newcastle University
GOLD MEDAL WINNER 2008
| Home | Team | Original Aims | Software | Modelling | Proof of Concept Brick | Wet Lab | Conclusions |
|---|
Home >> Aim >> Evolutionary Algorithm
Evolutionary Algorithm
Aim:
Develop a system that will evolve genetic circuits represented as networks that meet the functional requirements specified by the team's target application.
Traditional genetic engineering techniques have built small biological circuits by hand. However, this approach will not scale to whole-organism engineering. For synthetic biology at this scale computational design will be essential. “Soft” computing techniques such as evolutionary computation and computational intelligence were developed to handle exactly this sort of large, complex, hard-to-define problem.
Objectives:
- Reads parts list from parts repository
- Reads constraints on parts assembly (from Constraints Repository)
- Evolutionary algorithm assembles part models to a larger model
- Simulates the behaviour of the composite model
- Reads desired 'input' behaviour from Workbench
- Reads desired 'output' behaviour from workbench
- Assesses fitness
- Mutates the model
- Output the fittest model as CellML (to workbench)
Contributors:
Lead: Team:Newcastle University/Mark Wappett
