2012
DOI: 10.1002/bies.201100144
|View full text |Cite
|
Sign up to set email alerts
|

Scientific discovery as a combinatorial optimisation problem: How best to navigate the landscape of possible experiments?

Abstract: A considerable number of areas of bioscience, including gene and drug discovery, metabolic engineering for the biotechnological improvement of organisms, and the processes of natural and directed evolution, are best viewed in terms of a ‘landscape’ representing a large search space of possible solutions or experiments populated by a considerably smaller number of actual solutions that then emerge. This is what makes these problems ‘hard’, but as such these are to be seen as combinatorial optimisation problems … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
43
0

Year Published

2013
2013
2022
2022

Publication Types

Select...
5
2
2

Relationship

4
5

Authors

Journals

citations
Cited by 46 publications
(47 citation statements)
references
References 109 publications
1
43
0
Order By: Relevance
“…Computational approaches are increasingly being viewed as critical for knowledge discovery in the natural sciences (Kell 2012). On one hand this may be addressed by using "big data" to reduce the space of possible solutions (Hey et al 2009).…”
Section: Discussion and Related Workmentioning
confidence: 99%
“…Computational approaches are increasingly being viewed as critical for knowledge discovery in the natural sciences (Kell 2012). On one hand this may be addressed by using "big data" to reduce the space of possible solutions (Hey et al 2009).…”
Section: Discussion and Related Workmentioning
confidence: 99%
“…In the past, and partly because of the enormous number of possible sequences [374][375][376] this was done rather empirically, using methods such as error-prone PCR (ePCR) [377][378][379] to introduce mutations. Although showing the utility of the general directed evolution strategy, this had three highly undesirable consequences: (i) there was no control over which mutations were made, (ii) the search could only be local, as high mutation rates necessarily introduced stop codons [379,380], and (iii) the reliance on selection of local 'winners' as starting points for the next generation inevitably meant that search was soon trapped in local minima from which it was impossible to escape (as was evident from many published studies showing a lack of further improvement after 3 or so generations, despite quite poor k cat values) [324].…”
Section: Synthetic Biology For Efflux Transporter Engineeringmentioning
confidence: 99%
“…This can therefore increase dramatically the rate of knowledge-based navigation of the relevant search space (Fox and Huisman, 2008; Kell, 2012; Romero et al , 2013) for functional screening, and coupled with efficient synthesis and expression in E. coli or any other preferred host can provide a platform for the potential screening of millions of sequence variants in a single generation.…”
Section: Discussionmentioning
confidence: 99%