An iterative deep learning-guided algorithm for directed protein evolution
Deep learning has rapidly emerged as a promising toolkit for protein optimization, yet its success remains limited, particularly in the realm of activity. Moreover, most algorithms lack rigorous iterative evaluation, a crucial aspect of protein engineering exemplified by classical directed evolution. This study introduces DeepDE, a robust iterative deep learning-guided algorithm leveraging triple mutants as building blocks and a compact library of ∼1,000 mutants for training. Triple mutants allow for the exploration of a much greater sequence space compared to single or double mutants in each iteration. When applied to GFP from <i>Aequorea victoria</i>, DeepDE achieved a remarkable 74.3-fold increase in activity over four rounds of evolution, far surpassing the benchmark superfolder GFP. Our study suggests that limited screening involving experimentally affordable ∼1,000 variants significantly enhances the performance of DeepDE, likely by mitigating the constraints imposed by the intractable data sparsity problem in protein engineering.
Authors
- Zhanglin Lin (ORCID: https://orcid.org/0000-0002-5223-7013)
- Fangfang Tang (ORCID: https://orcid.org/0000-0003-2761-8524)
- Xiaofeng Yang (ORCID: https://orcid.org/0000-0002-0828-0807)
- Jianfeng Li (ORCID: https://orcid.org/0000-0002-0865-790X)
- Xiaofan Li (ORCID: https://orcid.org/0000-0002-0165-9275)
- Qihan Wang (ORCID: https://orcid.org/0009-0003-6454-9617)
Institutions
- South China University of Technology (CN)
Publication Details
- Journal
- iScience
- Published
- 2025-08-08
- DOI
- https://doi.org/10.1016/j.isci.2025.113324
- Citations
- 2
- Primary Topic
- Machine Learning in Bioinformatics
- Type
- article
- Field-Weighted Citation Impact
- 1.61