计算机科学
蒙特卡罗方法
树(集合论)
多目标优化
化学空间
帕累托原理
药物发现
蒙特卡罗树搜索
数学优化
算法
机器学习
生物信息学
数学
统计
数学分析
生物
作者
Yifei Liu,Yiheng Zhu,Jike Wang,Renling Hu,Chao Shen,Wanglin Qu,Gaoang Wang,Qun Su,Yuchen Zhu,Yu Kang,Peichen Pan,Chang‐Yu Hsieh,Tingjun Hou
出处
期刊:Advanced Science
[Wiley]
日期:2025-04-04
卷期号:12 (20): e2410640-e2410640
被引量:11
标识
DOI:10.1002/advs.202410640
摘要
Drug discovery faces increasing challenges in identifying novel drug candidates satisfying multiple stringent objectives, such as binding affinity, protein target selectivity, and drug-likeness. Existing optimization methods struggle with the complexity of handling numerous objectives, limiting advancements in molecular design as most algorithms are only effective for up to four optimization objectives. To overcome these limitations, the study introduces the Pareto Monte Carlo Tree Search Molecular Generation (PMMG) method, leveraging Monte Carlo Tree Search (MCTS) to efficiently uncover the Pareto Front for molecular design tasks in high-dimensional objective space. By utilizing simplified molecular input line entry system (SMILES) to represent molecules, PMMG efficiently navigates the vast chemical space to discover molecules that exhibit multiple desirable attributes simultaneously. Numerical experiments demonstrate PMMG's superior performance, achieving a remarkable success rate of 51.65% in simultaneously optimizing seven objectives, outperforming current state-of-the-art algorithms by 2.5 times. An illustrative study targeting Epidermal Growth Factor Receptor (EGFR) and Human Epidermal Growth Factor Receptor 2 (HER2) highlights PMMG's ability to generate molecules with high docking scores for target proteins and favorable predicted drug-like properties. The results suggest that PMMG has the potential to significantly accelerate real-world drug discovery projects involving numerous optimization objectives.
科研通智能强力驱动
Strongly Powered by AbleSci AI