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 条
  • [21] Discovering Representations for Black-box Optimization
    Gaier, Adam
    Asteroth, Alexander
    Mouret, Jean-Baptiste
    GECCO'20: PROCEEDINGS OF THE 2020 GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE, 2020, : 103 - 111
  • [22] A Parallel Adaptive Swarm Search Framework for Solving Black-Box Optimization Problems
    Shuka, Romeo
    Brehm, Juergen
    ARCHITECTURE OF COMPUTING SYSTEMS - ARCS 2019, 2019, 11479 : 100 - 111
  • [23] Combining a local search and Grover's algorithm in black-box global optimization
    Bulger, D. W.
    JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 2007, 133 (03) : 289 - 301
  • [24] Safe non-smooth black-box optimization with application to policy search
    Usmanova, Ilnura
    Krause, Andreas
    Kamgarpour, Maryam
    LEARNING FOR DYNAMICS AND CONTROL, VOL 120, 2020, 120 : 980 - 989
  • [25] The black-box complexity of nearest neighbor search
    Krauthgamer, R
    Lee, JR
    AUTOMATA , LANGUAGES AND PROGRAMMING, PROCEEDINGS, 2004, 3142 : 858 - 869
  • [26] Learning Search Space Partition for Black-box Optimization using Monte Carlo Tree Search
    Wang, Linnan
    Fonseca, Rodrigo
    Tian, Yuandong
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 33, NEURIPS 2020, 2020, 33
  • [27] Combining a Local Search and Grover’s Algorithm in Black-Box Global Optimization
    D. W. Bulger
    Journal of Optimization Theory and Applications, 2007, 133 : 289 - 301
  • [28] Black-box Search by Elimination of Fitness Functions
    Anil, Gautham
    Wiegand, R. Paul
    FOGA'09: PROCEEDINGS OF THE 10TH ACM SIGRVO CONFERENCE ON FOUNDATIONS OF GENETIC ALGORITHMS, 2009, : 67 - 77
  • [29] Unbiased Black-Box Complexity of Parallel Search
    Badkobeh, Golnaz
    Lehre, Per Kristian
    Sudholt, Dirk
    PARALLEL PROBLEM SOLVING FROM NATURE - PPSN XIII, 2014, 8672 : 892 - 901
  • [30] Unbiased black-box complexity of parallel search
    Badkobeh, Golnaz
    Lehre, Per Kristian
    Sudholt, Dirk
    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2014, 8672 : 892 - 901