.png){kind=icon}
返回
Customizing scoring functions for docking
.png){kind=icon}
OA
AI
DOI：10.1007/s10822-008-9174-y.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Empirical scoring functions used in protein-ligand docking calculations are typically trained on a dataset of complexes with known affinities with the aim of generalizing across different docking applications. We report a novel method of scoring-function optimization that supports the use of additional information to constrain scoring function parameters, which can be used to focus a scoring function's training towards a particular application, such as screening enrichment. The approach combines multiple instance learning, positive data in the form of ligands of protein binding sites of known and unknown affinity and binding geometry, and negative (decoy) data of ligands thought not to bind particular protein binding sites or known not to bind in particular geometries. Performance of the method for the Surflex-Dock scoring function is shown in cross-validation studies and in eight blind test cases. Tuned functions optimized with a sufficient amount of data exhibited either improved or undiminished screening performance relative to the original function across all eight complexes. Analysis of the changes to the scoring function suggest that modifications can be learned that are related to protein-specific features such as active-site mobility.
Keyword:
PROTEIN-LIGAND INTERACTIONS
MOLECULAR DOCKING
AUTOMATED DOCKING
BINDING-AFFINITY
FLEXIBLE LIGANDS
DRUG DESIGN
ACETYLCHOLINESTERASE
VALIDATION
INHIBITORS
ALGORITHM
期刊
J
IF:
3.1
论文数:
2.5K
被引数:
5.8K
机构
引用论文
.png){kind=icon}
分享收藏分享收藏Surflex: Fully automatic flexible molecular docking using a molecular similarity-based search engine
PREAI
分享收藏分享收藏A general and fast scoring function for protein-ligand interactions: A simplified potential approach
PREAI
分享收藏
查看更多内容