返回
Molecular docking with multi-objective particle swarm optimization
DOI:10.1016/j.asoc.2007.05.005.png)
摘要
En 中文
The molecular docking problem is to find a good position and orientation for docking a small molecule ( ligand) to a larger receptor molecule. In the first part of this paper we propose a new algorithm for solving the docking problem. This algorithm-called ClustMPSO-is based on Particle Swarm Optimization (PSO) and follows a multi-objective approach for comparing the quality of solutions. For the energy evaluation the algorithm uses the binding free energy function that is provided by the Autodock 3.05 tool. The experimental results show that ClustMPSO computes a more diverse set of possible docking conformations than the standard Simulated Annealing and Lamarckian Genetic Algorithm that are incorporated into Autodock. Moreover, ClustMPSO is significantly faster and more reliable in finding good solutions. In the second part of this paper a new approach for the prediction of a docking trajectory is proposed. In this approach the ligand is un-docked'' via a controlled random walk that can be biased into a given direction and where only positions are accepted that have an energy level that is below a given threshold. (C) 2007 Elsevier B.V. All rights reserved.
Keyword:
particle swarm optimization
multi-objective optimization
molecular docking
docking trajectory prediction
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.6
论文数:
1.4W
被引数:
4.8W
机构
暂无机构信息
引用论文
Principles of docking: An overview of search algorithms and a guide to scoring functions对接原理: 搜索算法概述和评分函数指南

