Suppr超能文献

灵活配体对接算法的综合评估:当前的有效性和挑战。

Comprehensive assessment of flexible-ligand docking algorithms: current effectiveness and challenges.

机构信息

School of Physics, Huazhong University of Science and Technology, Wuhan, Hubei, P. R. China.

出版信息

Brief Bioinform. 2018 Sep 28;19(5):982-994. doi: 10.1093/bib/bbx030.

Abstract

Protein-ligand docking has been playing an important role in modern drug discovery. To model drug-target binding in real systems, a number of flexible-ligand docking algorithms with different sampling strategies and scoring methods have been subsequently developed over the past three decades, while rigid-ligand docking is still being used because of its compelling computational efficiency. Here, a comprehensive assessment has been conducted to investigate the effectiveness of flexible-ligand docking versus rigid-ligand docking for three representative docking algorithms (global optimization, incremental construction and multi-conformer docking) in virtual screening and pose prediction on the Directory of Useful Decoys. It was found that overall flexible-ligand docking did not achieve a statistically significant improvement in enrichments over rigid-ligand docking in virtual screening, but all docking programs significantly improved the success rates when considering ligand flexibility in pose prediction. The worse effectiveness of flexible-ligand docking in virtual screening than in pose prediction suggests that the challenges of current docking algorithms exist in ranking more than docking, although the use of flexible-ligand docking in virtual screening was justified by its better effectiveness for more flexible ligand in virtual screening. Challenges for scoring, including internal energy, charge polarization, entropy and flexibility, were investigated and discussed. An empirical way was also proposed to consider loss of ligand conformational entropy for virtual screening.

摘要

蛋白质-配体对接在现代药物发现中发挥着重要作用。为了在实际系统中模拟药物-靶标结合,在过去的三十年中,已经开发了许多具有不同采样策略和评分方法的柔性配体对接算法,而刚性配体对接仍然在使用,因为它具有引人注目的计算效率。在这里,我们对三种代表性的对接算法(全局优化、逐步构建和多构象对接)进行了全面评估,以研究柔性对接与刚性对接在虚拟筛选和目录中的有用诱饵的构象预测中的有效性。结果发现,总体而言,在虚拟筛选中,柔性对接并没有在富集度上显著优于刚性对接,但所有对接程序在考虑配体柔性的构象预测中都显著提高了成功率。柔性对接在虚拟筛选中的效果不如构象预测好,这表明当前对接算法的挑战在于排序而不是对接,尽管在虚拟筛选中使用柔性对接是合理的,因为它在虚拟筛选中更灵活的配体方面效果更好。还研究和讨论了评分的挑战,包括内能、电荷极化、熵和柔性。还提出了一种经验方法来考虑虚拟筛选中配体构象熵的损失。

文献AI研究员

20分钟写一篇综述,助力文献阅读效率提升50倍。

立即体验

用中文搜PubMed

大模型驱动的PubMed中文搜索引擎

马上搜索

文档翻译

学术文献翻译模型,支持多种主流文档格式。

立即体验