MolSearch: Search-based Multi-objective Molecular Generation and Property Optimization

被引:17
作者
Sun, Mengying [1 ]
Xing, Jing [2 ]
Meng, Han [1 ]
Wang, Huijun [3 ]
Chen, Bin [2 ]
Zhou, Jiayu [1 ]
机构
[1] Michigan State Univ, E Lansing, MI 48824 USA
[2] Michigan State Univ, Grand Rapids, MI USA
[3] Agios Pharmaceut, Cambridge, MA USA
来源
PROCEEDINGS OF THE 28TH ACM SIGKDD CONFERENCE ON KNOWLEDGE DISCOVERY AND DATA MINING, KDD 2022 | 2022年
基金
美国国家科学基金会;
关键词
Molecular Generation and Optimization; Monte Carlo Tree Search; Design Moves; CARLO TREE-SEARCH; DESIGN; ALGORITHM;
D O I
10.1145/3534678.3542676
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Leveraging computational methods to generate small molecules with desired properties has been an active research area in the drug discovery field. Towards real-world applications, however, efficient generation of molecules that satisfy multiple property requirements simultaneously remains a key challenge. In this paper, we tackle this challenge using a search-based approach and propose a simple yet effective framework called MolSearch for multi-objective molecular generation (optimization).We show that given proper design and sufficient domain information, search-based methods can achieve performance comparable or even better than deep learning methods while being computationally efficient. Such efficiency enables massive exploration of chemical space given constrained computational resources. In particular, MolSearch starts with existing molecules and uses a two-stage search strategy to gradually modify them into new ones, based on transformation rules derived systematically and exhaustively from large compound libraries. We evaluate MolSearch in multiple benchmark generation settings and demonstrate its effectiveness and efficiency.
引用
收藏
页码:4724 / 4732
页数:9
相关论文
共 43 条
[1]  
Ahn Sungsoo, 2020, ARXIV200704897
[2]   Finite-time analysis of the multiarmed bandit problem [J].
Auer, P ;
Cesa-Bianchi, N ;
Fischer, P .
MACHINE LEARNING, 2002, 47 (2-3) :235-256
[3]   The Playbooks of Medicinal Chemistry Design Moves [J].
Awale, Mahendra ;
Hert, Jerome ;
Guasch, Laura ;
Riniker, Sereina ;
Kramer, Christian .
JOURNAL OF CHEMICAL INFORMATION AND MODELING, 2021, 61 (02) :729-742
[4]   Why is Tanimoto index an appropriate choice for fingerprint-based similarity calculations? [J].
Bajusz, David ;
Racz, Anita ;
Heberger, Kroly .
JOURNAL OF CHEMINFORMATICS, 2015, 7
[5]   A MARKOVIAN DECISION PROCESS [J].
BELLMAN, R .
JOURNAL OF MATHEMATICS AND MECHANICS, 1957, 6 (05) :679-684
[6]  
Bickerton GR, 2012, NAT CHEM, V4, P90, DOI [10.1038/NCHEM.1243, 10.1038/nchem.1243]
[7]  
Blass BE, 2015, BASIC PRINCIPLES OF DRUG DISCOVERY AND DEVELOPMENT, P1, DOI 10.1016/C2012-0-06670-7
[8]   A Survey of Monte Carlo Tree Search Methods [J].
Browne, Cameron B. ;
Powley, Edward ;
Whitehouse, Daniel ;
Lucas, Simon M. ;
Cowling, Peter I. ;
Rohlfshagen, Philipp ;
Tavener, Stephen ;
Perez, Diego ;
Samothrakis, Spyridon ;
Colton, Simon .
IEEE TRANSACTIONS ON COMPUTATIONAL INTELLIGENCE AND AI IN GAMES, 2012, 4 (01) :1-43
[9]   Unsupervised data base clustering based on Daylight's fingerprint and Tanimoto similarity: A fast and automated way to cluster small and large data sets [J].
Butina, D .
JOURNAL OF CHEMICAL INFORMATION AND COMPUTER SCIENCES, 1999, 39 (04) :747-750
[10]  
Chen Weizhe, 2021, ARXIV211101825