2018
DOI: 10.1101/344564
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Designing Minimal Genomes Using Whole-Cell Models

Abstract: In the future, entire genomes tailored to specific functions and environments could be designed using computational tools. However, computational tools to design cells are scarce. Here we present work implementing computational design-simulate-test cycles for genome optimisation based on whole cell modelling. Similar approaches could be adapted to any goal in genome design, but to demonstrate feasibility, we selected the identification of minimal genomes as a proof of concept, using the first (and currently on… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
12
0

Year Published

2019
2019
2020
2020

Publication Types

Select...
3
1

Relationship

2
2

Authors

Journals

citations
Cited by 4 publications
(12 citation statements)
references
References 29 publications
0
12
0
Order By: Relevance
“…The case study shows how to implement a genetic algorithm and run it on different clusters. Rees and Chalkley et al [37] also show how to implement a different algorithm. Whilst it has not been shown yet, the modularity of the code may make it possible to use different models and even different design goals.…”
Section: Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“…The case study shows how to implement a genetic algorithm and run it on different clusters. Rees and Chalkley et al [37] also show how to implement a different algorithm. Whilst it has not been shown yet, the modularity of the code may make it possible to use different models and even different design goals.…”
Section: Resultsmentioning
confidence: 99%
“…Both job managers are commonly used for computer clusters and so these examples can be used as templates for other clusters with these job managers, otherwise they still act as an example of how to write a connection sub-class -for more information on this see the supplementary information. For an example of implementing a different algorithm using PyGDS see the guess, add, mate algorithm (GAMA) in [37] which is implemented as three separate algorithms using the PyGDS framework where the results of a previous stage are fed into the next next stagecombined these three stages act like a modified genetic algorithm that is designed to converge on a minimal genome faster.…”
Section: Pygds Frameworkmentioning
confidence: 99%
“…[8,12] This is an ecessary caveat as doubling time varies widely amonge xtant bacteria. [8,12] This is an ecessary caveat as doubling time varies widely amonge xtant bacteria.…”
Section: Core Accessory and Quasi-essential Genesmentioning
confidence: 99%
“…When designing am inimal genomet hat supports life, an arbitraryt ime limit for cell division is often set to render the cellline experimentally practical. [8,12] This is an ecessary caveat as doubling time varies widely amonge xtant bacteria. [13] Therefore, in addition to core and accessory genes, minimal genomesa lso contain quasi-essential genes (i.e.,g enes required for an organism to meet an arbitrarily set maximum doubling time, but that might not be necessaryi ft hat parameter were removed).…”
Section: Core Accessory and Quasi-essential Genesmentioning
confidence: 99%
See 1 more Smart Citation