Molecular docking with multi-objective Particle Swarm Optimization

Authors:
Stefan Janson;Daniel Merkle;Martin Middendorf
Affiliations:
Department of Computer Science, University of Leipzig, Augustusplatz 10-11, D-04109 Leipzig, Germany;Department of Computer Science, University of Leipzig, Augustusplatz 10-11, D-04109 Leipzig, Germany;Department of Computer Science, University of Leipzig, Augustusplatz 10-11, D-04109 Leipzig, Germany
Venue:
Applied Soft Computing
Year:
2008

Citing 8
Cited 16

Data clustering: a review

ACM Computing Surveys (CSUR)
The particle swarm optimization algorithm: convergence analysis and parameter selection

Information Processing Letters
Evolutionary Algorithms in Drug Design

Natural Computing: an international journal
Fundamentals of Computational Swarm Intelligence

Fundamentals of Computational Swarm Intelligence
PLANTS: application of ant colony optimization to structure-based drug design

ANTS'06 Proceedings of the 5th international conference on Ant Colony Optimization and Swarm Intelligence
Parallelization of multi-objective evolutionary algorithms using clustering algorithms

EMO'05 Proceedings of the Third international conference on Evolutionary Multi-Criterion Optimization
A MOPSO algorithm based exclusively on pareto dominance concepts

EMO'05 Proceedings of the Third international conference on Evolutionary Multi-Criterion Optimization
A new multi-objective particle swarm optimization algorithm using clustering applied to automated docking

HM'05 Proceedings of the Second international conference on Hybrid Metaheuristics

Design of stock trading system for historical market data using multiobjective particle swarm optimization of technical indicators

Proceedings of the 10th annual conference companion on Genetic and evolutionary computation
Optimization in water systems: a PSO approach

Proceedings of the 2008 Spring simulation multiconference
Multi-objective particle swarm optimization algorithm based on game strategies

Proceedings of the first ACM/SIGEVO Summit on Genetic and Evolutionary Computation
Activity assigning of fourth party logistics by particle swarm optimization-based preemptive fuzzy integer goal programming

Expert Systems with Applications: An International Journal
Improved performance of PSO with self-adaptive parameters for computing the optimal design of Water Supply Systems

Engineering Applications of Artificial Intelligence
Predicted modified PSO with time-varying accelerator coefficients

International Journal of Bio-Inspired Computation
Stock trading system based on the multi-objective particle swarm optimization of technical indicators on end-of-day market data

Applied Soft Computing
Two-stage fuzzy stochastic programming with Value-at-Risk criteria

Applied Soft Computing
Non-smooth economic dispatch computation by fuzzy and self adaptive particle swarm optimization

Applied Soft Computing
An adjusted simulated annealing approach to particle swarm optimization: empirical performance in decision making

ACIIDS'11 Proceedings of the Third international conference on Intelligent information and database systems - Volume Part II
Bonding as a swarm: applying bee nest-site selection behaviour to protein docking

Proceedings of the 13th annual conference on Genetic and evolutionary computation
A new Chance-Variance optimization criterion for portfolio selection in uncertain decision systems

Expert Systems with Applications: An International Journal
Molecular docking with opposition-based differential evolution

Proceedings of the 27th Annual ACM Symposium on Applied Computing
Identification of surgical practice patterns using evolutionary cluster analysis

Mathematical and Computer Modelling: An International Journal
Survey: Multi-criterion Pareto based particle swarm optimized polynomial neural network for classification: A review and state-of-the-art

Computer Science Review
Particle swarm optimization for solving engineering problems: A new constraint-handling mechanism

Engineering Applications of Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.