Extensive antibody search with whole spectrum black-box optimization

被引:0
|
作者
Tucs, Andrejs [1 ]
Ito, Tomoyuki [2 ]
Kurumida, Yoichi [3 ,7 ]
Kawada, Sakiya [2 ]
Nakazawa, Hikaru [2 ]
Saito, Yutaka [1 ,3 ,4 ,5 ,7 ]
Umetsu, Mitsuo [2 ,4 ]
Tsuda, Koji [1 ,4 ,6 ]
机构
[1] Univ Tokyo, Grad Sch Frontier Sci, Kashiwa, Japan
[2] Tohoku Univ, Grad Sch Engn, Dept Biomol Engn, Sendai, Japan
[3] Natl Inst Adv Ind Sci & Technol, Artificial Intelligence Res Ctr, Tokyo, Japan
[4] RIKEN, RIKEN Ctr Adv Intelligence Project, Tokyo 1030027, Japan
[5] Waseda Univ, Computat Bio Big Data Open Innovat Lab CBBD OIL, AIST, Tokyo, Japan
[6] Natl Inst Mat Sci NIMS, Ctr Basic Res Mat, Tsukuba, Japan
[7] Kitasato Univ, Sch Frontier Engn, Dept Data Sci, Sagamihara, Japan
基金
日本科学技术振兴机构;
关键词
PROTEIN; DESIGN;
D O I
10.1038/s41598-023-51095-z
中图分类号
O [数理科学和化学]; P [天文学、地球科学]; Q [生物科学]; N [自然科学总论];
学科分类号
07 ; 0710 ; 09 ;
摘要
In designing functional biological sequences with machine learning, the activity predictor tends to be inaccurate due to shortage of data. Top ranked sequences are thus unlikely to contain effective ones. This paper proposes to take prediction stability into account to provide domain experts with a reasonable list of sequences to choose from. In our approach, multiple prediction models are trained by subsampling the training set and the multi-objective optimization problem, where one objective is the average activity and the other is the standard deviation, is solved. The Pareto front represents a list of sequences with the whole spectrum of activity and stability. Using this method, we designed VHH (Variable domain of Heavy chain of Heavy chain) antibodies based on the dataset obtained from deep mutational screening. To solve multi-objective optimization, we employed our sequence design software MOQA that uses quantum annealing. By applying several selection criteria to 19,778 designed sequences, five sequences were selected for wet-lab validation. One sequence, 16 mutations away from the closest training sequence, was successfully expressed and found to possess desired binding specificity. Our whole spectrum approach provides a balanced way of dealing with the prediction uncertainty, and can possibly be applied to extensive search of functional sequences.
引用
下载
收藏
页数:7
相关论文
共 50 条
  • [1] Extensive antibody search with whole spectrum black-box optimization
    Andrejs Tučs
    Tomoyuki Ito
    Yoichi Kurumida
    Sakiya Kawada
    Hikaru Nakazawa
    Yutaka Saito
    Mitsuo Umetsu
    Koji Tsuda
    Scientific Reports, 14
  • [2] Optimistic tree search strategies for black-box combinatorial optimization
    Malherbe, Cedric
    Grosnit, Antoine
    Tutunov, Rasul
    Wang, Jun
    Bou-Ammar, Haitham
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 35 (NEURIPS 2022), 2022,
  • [3] A black-box scatter search for optimization problems with integer variables
    Laguna, Manuel
    Gortazar, Francisco
    Gallego, Micael
    Duarte, Abraham
    Marti, Rafael
    JOURNAL OF GLOBAL OPTIMIZATION, 2014, 58 (03) : 497 - 516
  • [4] Accelerated Random Search for Black-Box Constraint Satisfaction and Optimization
    Iorio, Jenna N.
    Regis, Rommel G.
    2021 IEEE SYMPOSIUM SERIES ON COMPUTATIONAL INTELLIGENCE (IEEE SSCI 2021), 2021,
  • [5] Black-Box Optimization in an Extended Search Space for SAT Solving
    Zaikin, Oleg
    Kochemazov, Stepan
    MATHEMATICAL OPTIMIZATION THEORY AND OPERATIONS RESEARCH, 2019, 11548 : 402 - 417
  • [6] A black-box scatter search for optimization problems with integer variables
    Manuel Laguna
    Francisco Gortázar
    Micael Gallego
    Abraham Duarte
    Rafael Martí
    Journal of Global Optimization, 2014, 58 : 497 - 516
  • [7] Versatile Black-Box Optimization
    Liu, Jialin
    Moreau, Antoine
    Preuss, Mike
    Rapin, Jeremy
    Roziere, Baptiste
    Teytaud, Fabien
    Teytaud, Olivier
    GECCO'20: PROCEEDINGS OF THE 2020 GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE, 2020, : 620 - 628
  • [8] Black-box Optimization with a Politician
    Bubeck, Sebastien
    Lee, Yin-Tat
    INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 48, 2016, 48
  • [9] Black-Box Search by Unbiased Variation
    Lehre, Per Kristian
    Witt, Carsten
    ALGORITHMICA, 2012, 64 (04) : 623 - 642
  • [10] Black-Box Search by Unbiased Variation
    Per Kristian Lehre
    Carsten Witt
    Algorithmica, 2012, 64 : 623 - 642