Adaptive molecular docking method based on information entropy genetic algorithm |
| |
Affiliation: | 1. Department of Periodontology, The Stomatology Affiliated Hospital of Harbin Medical University, 143 Yiman Street, Nangang District, Harbin, Heilongjiang, China;2. Center for Endemic Disease Control, The China Center for Disease Control and Prevention and Harbin Medical University, 157 Baojian Road, Nangang District, Harbin, Heilongjiang, China;3. Department of Stomatology, The Fourth Affiliated Hospital of Harbin Medical University, 37 Yiyuan Street, Nangang District, Harbin, Heilongjiang, China |
| |
Abstract: | 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. |
| |
Keywords: | Molecular docking Genetic algorithm Information entropy Self-adaptive Optimization |
本文献已被 ScienceDirect 等数据库收录! |
|