Bonding as a swarm: applying bee nest-site selection behaviour to protein docking

The identification of protein binding sites and the prediction of protein-ligand complexes play a key role in the pharmaceutical drug design process and many domains of life sciences. Computational approaches for protein-ligand docking (or molecular docking) have received increased attention over the last years as they allow inexpensive and fast prediction of protein-ligand complexes. Here we introduce the principle of Bee Nest-Site Selection Optimisation (BNSO), which solves optimisation problems using a novel scheme inspired by the nest-site selection behaviour found in honeybees. Moreover, the first BNSO algorithm -- Bee-Nest -- is proposed and applied to molecular docking. The performance of Bee-Nest is tested on 173 docking instances from the PDBbind core set and compared to the performance of three reference algorithms. The results show that Bee-Nest could find ligand poses with very small energy levels. Interestingly, the reference Particle Swarm Optimization (PSO) produces results that are qualitatively closer to wet-lab experimentally derived complexes but have higher energy levels than the results found by Bee-Nest. Our results highlight the superior performance of Bee-Nest in semi-local optimization for the molecular docking problem and suggests Bee-Nest's usefulness in a hybrid strategy.

[1]  Renxiao Wang,et al.  The PDBbind database: collection of binding affinities for protein-ligand complexes with known three-dimensional structures. , 2004, Journal of medicinal chemistry.

[2]  F. Ratnieks Honeybee Democracy Thomas D. Seeley Honeybee Democracy , 2011, Animal Behaviour.

[3]  Muddassar Farooq Bee-Inspired Protocol Engineering: From Nature to Networks , 2008 .

[4]  Dervis Karaboga,et al.  A survey: algorithms simulating bee swarm intelligence , 2009, Artificial Intelligence Review.

[5]  Takuji Nishimura,et al.  Mersenne twister: a 623-dimensionally equidistributed uniform pseudo-random number generator , 1998, TOMC.

[6]  Yuhui Shi,et al.  Handbook of Swarm Intelligence: Concepts, Principles and Applications , 2011 .

[7]  Shiow-Fen Hwang,et al.  Flexible protein-ligand docking using particle swarm optimization , 2005, 2005 IEEE Congress on Evolutionary Computation.

[8]  R. Glen,et al.  Molecular recognition of receptor sites using a genetic algorithm with a description of desolvation. , 1995, Journal of molecular biology.

[9]  Peter Kampstra,et al.  Beanplot: A Boxplot Alternative for Visual Comparison of Distributions , 2008 .

[10]  Thomas Stützle,et al.  PLANTS: Application of Ant Colony Optimization to Structure-Based Drug Design , 2006, ANTS Workshop.

[11]  T. Seeley,et al.  Sensory coding of nest-site value in honeybee swarms , 2008, Journal of Experimental Biology.

[12]  Mary R Myerscough,et al.  Dancing for a decision: a matrix model for nest–site choice by honeybees , 2003, Proceedings of the Royal Society of London. Series B: Biological Sciences.

[13]  Thomas Schmickl,et al.  Trophallaxis within a robotic swarm: bio-inspired communication among robots in a swarm , 2008, Auton. Robots.

[14]  I. Muegge PMF scoring revisited. , 2006, Journal of medicinal chemistry.

[15]  René Meier,et al.  ParaDockS: A Framework for Molecular Docking with Population-Based Metaheuristics , 2010, J. Chem. Inf. Model..

[16]  Kevin M Schultz,et al.  The mechanism of flight guidance in honeybee swarms: subtle guides or streaker bees? , 2008, Journal of Experimental Biology.

[17]  Stefan Janson,et al.  Molecular docking with multi-objective Particle Swarm Optimization , 2008, Appl. Soft Comput..

[18]  Martin Middendorf,et al.  Bee Nest Site Selection as an Optimization Process , 2010, ALIFE.

[19]  Martin Middendorf,et al.  Searching for a new home—scouting behavior of honeybee swarms , 2007 .

[20]  Ruth Nussinov,et al.  Principles of docking: An overview of search algorithms and a guide to scoring functions , 2002, Proteins.