2018
DOI: 10.1021/acssynbio.8b00155
|View full text |Cite
|
Sign up to set email alerts
|

Machine-Learning-Guided Mutagenesis for Directed Evolution of Fluorescent Proteins

Abstract: Molecular evolution based on mutagenesis is widely used in protein engineering. However, optimal proteins are often difficult to obtain due to a large sequence space. Here, we propose a novel approach that combines molecular evolution with machine learning. In this approach, we conduct two rounds of mutagenesis where an initial library of protein variants is used to train a machine-learning model to guide mutagenesis for the second-round library. This enables us to prepare a small library suited for screening … Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
136
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
5
3
1

Relationship

1
8

Authors

Journals

citations
Cited by 128 publications
(141 citation statements)
references
References 43 publications
0
136
0
Order By: Relevance
“…higher-throughput methods such as deep mutational scanning (36) serve as valuable test beds for validating the latest machinelearning algorithms for regression (37,38) and design (39) that require more data. An evolution strategy similar in spirit to that described here was recently applied to the evolution of GFP fluorescence (40). However, the implementations are quite different.…”
Section: Discussionmentioning
confidence: 99%
See 1 more Smart Citation
“…higher-throughput methods such as deep mutational scanning (36) serve as valuable test beds for validating the latest machinelearning algorithms for regression (37,38) and design (39) that require more data. An evolution strategy similar in spirit to that described here was recently applied to the evolution of GFP fluorescence (40). However, the implementations are quite different.…”
Section: Discussionmentioning
confidence: 99%
“…However, the implementations are quite different. Saito et al (40) used Gaussian processes to rank sequences based on their probability of improvement, or the probability that a variant outperforms those in the training set. We take a different approach of identifying the optimal variants, focusing efforts in the area of sequence space with highest fitness.…”
Section: Discussionmentioning
confidence: 99%
“…The most beneficial mutations can then be fixed, deleterious mutations can be eliminated from the pool of considered mutations, and new mutations can be added to the pool. 13 Alternately, the model can be used to select combinations of mutations that have a high probability of improving function 45 or to directly predict highly improved variants. 10 Learning and selection can also be performed directly over sequences.…”
Section: Using Sequence-function Predictions To Guide Explorationmentioning
confidence: 99%
“…In recent years, various parameter optimization methods [17] such as Bayesian optimization (BO) and evolutionary algorithms have been proposed in the field of machine learning and applied to a wide range of actual problems such as parameter optimization of deep neural networks [18,19], combination of materials [20], and protein design [21]. Most parameter optimization techniques effectively find the optimal parameter.…”
Section: Introductionmentioning
confidence: 99%