arrow
Return

Adaptive molecular docking method based on information entropy genetic algorithm

delete2015-01-01
delete51
PRE
AI
谷俊峰 (Junfeng Gu)
康玲 (Ling Kang)
赵晓昱 cover
赵晓昱 (Xiaoyu Zhao)
Q
Quan Guo
DOI:10.1016/j.asoc.2014.10.008delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
Almost all the molecule docking models, using by widespread docking software, are approximate. Approximation will make the scoring function inaccurate under some circumstances. This study proposed a new molecule docking scoring method: based on force-field scoring function, it use information entropy genetic algorithm to solve the docking problem. Empirical-based and knowledge-based scoring function are also considered in this method. Instead of simple combination with fixed weights, coefficients of each factor are adaptive in the process of searching optimum solution. Genetic algorithm with the multi-population evolution and entropy-based searching technique with narrowing down space is used to solve the optimization model for molecular docking problem. To evaluate this method, we carried out a numerical experiment with 134 protein-ligand complexes of the publicly available GOLD test set. The results show that this study improved the docking accuracy over the individual force-field scoring greatly. Comparing with other popular docking software, it has the best average Root-Mean-Square Deviation (RMSD). The average computing time of this study is also good among them. (C) 2014 Elsevier B.V. All rights reserved.
Keywords:
Molecular docking
Genetic algorithm
Information entropy
Self-adaptive
Optimization
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

Applied Soft Computing cover
Applied Soft Computing
IF:
6.6
Papers:
1.4W
Citations:
4.8W

Organization

D
Dalian University of Technology
Scholars:
5.9W
Papers: 4.4W
Citations: 5.5W