A new tri-objective model for the flexible docking problem

Slides:



Advertisements
Similar presentations
Population-based metaheuristics Nature-inspired Initialize a population A new population of solutions is generated Integrate the new population into the.
Advertisements

MOEAs University of Missouri - Rolla Dr. T’s Course in Evolutionary Computation Matt D. Johnson November 6, 2006.
Angers, 10 June 2010 Multi-Objective Optimisation (II) Matthieu Basseur.
CS6800 Advanced Theory of Computation
Using Parallel Genetic Algorithm in a Predictive Job Scheduling
Bioinformatics Vol. 21 no (Pages ) Reporter: Yu Lun Kuo (D )
Iterative Relaxation of Constraints (IRC) Can’t solve originalCan solve relaxed PRMs sample randomly but… start goal C-obst difficult to sample points.
1 Wendy Williams Metaheuristic Algorithms Genetic Algorithms: A Tutorial “Genetic Algorithms are good at taking large, potentially huge search spaces and.
New models for the docking problem Jean-Charles BOISSON Image from the ArgusLab software.
Genetic Algorithms for Bin Packing Problem Hazem Ali, Borislav Nikolić, Kostiantyn Berezovskyi, Ricardo Garibay Martinez, Muhammad Ali Awan.
Two Examples of Docking Algorithms With thanks to Maria Teresa Gil Lucientes.
Protein Docking and Interactions Modeling CS 374 Maria Teresa Gil Lucientes November 4, 2004.
EMBIO – Cambridge Particle Swarm Optimization applied to Automated Docking Automated docking of a ligand to a macromolecule Particle Swarm Optimization.
Genetic Algorithms and Protein Folding Based on lecture by Dr. Steffen Schulze-Kremer
BL5203: Molecular Recognition & Interaction Lecture 5: Drug Design Methods Ligand-Protein Docking (Part I) Prof. Chen Yu Zong Tel:
Molecular Docking Using GOLD Tommi Suvitaival Seppo Virtanen S Basics for Biosystems of the Cell Fall 2006.
Protein-protein and Protein- ligand Docking The geometric filtering.
Software framework for metaheuristics Parallel Cooperative Optimization Research Group Laboratoire d’Informatique Fondamentale de Lille
Inverse Kinematics for Molecular World Sadia Malik April 18, 2002 CS 395T U.T. Austin.
Geometry Optimisation Modelling OH + C 2 H 4 *CH 2 -CH 2 -OH CH 3 -CH 2 -O* 3D PES.
Combinatorial Optimization on the Computational Grid Experiments on Grid5000 Nouredine Melab ( ) Member of Grid5000 steering committee Laboratoire.
Genetic Algorithm.
Leiden University. The university to discover. Enhancing Search Space Diversity in Multi-Objective Evolutionary Drug Molecule Design using Niching 1. Leiden.
Evolutionary Algorithms BIOL/CMSC 361: Emergence Lecture 4/03/08.
A genetic algorithm for structure based de-novo design Scott C.-H. Pegg, Jose J. Haresco & Irwin D. Kuntz February 21, 2006.
ART – Artificial Reasoning Toolkit Evolving a complex system Marco Lamieri Spss training day
Chih-Ming Chen, Student Member, IEEE, Ying-ping Chen, Member, IEEE, Tzu-Ching Shen, and John K. Zao, Senior Member, IEEE Evolutionary Computation (CEC),
Optimization Problems - Optimization: In the real world, there are many problems (e.g. Traveling Salesman Problem, Playing Chess ) that have numerous possible.
Omni-Optimizer A Procedure for Single and Multi-objective Optimization Prof. Kalyanmoy Deb and Santosh Tiwari.
1 “Genetic Algorithms are good at taking large, potentially huge search spaces and navigating them, looking for optimal combinations of things, solutions.
Simulation in Wind Turbine Vibrations: A Data Driven Analysis Graduate Students: Zijun Zhang PI: Andrew Kusiak Intelligent Systems Laboratory The University.
Altman et al. JACS 2008, Presented By Swati Jain.
DIVERSITY PRESERVING EVOLUTIONARY MULTI-OBJECTIVE SEARCH Brian Piper1, Hana Chmielewski2, Ranji Ranjithan1,2 1Operations Research 2Civil Engineering.
Materials Process Design and Control Laboratory ON THE DEVELOPMENT OF WEIGHTED MANY- BODY EXPANSIONS USING AB-INITIO CALCULATIONS FOR PREDICTING STABLE.
Evolving RBF Networks via GP for Estimating Fitness Values using Surrogate Models Ahmed Kattan Edgar Galvan.
Surflex: Fully Automatic Flexible Molecular Docking Using a Molecular Similarity-Based Search Engine Ajay N. Jain UCSF Cancer Research Institute and Comprehensive.
1 ParadisEO-MOEO for a Bi-objective Flow-Shop Scheduling Problem May 2007 E.-G. Talbi and the ParadisEO team
Mean Field Theory and Mutually Orthogonal Latin Squares in Peptide Structure Prediction N. Gautham Department of Crystallography and Biophysics University.
Protein structure prediction Computer-aided pharmaceutical design: Modeling receptor flexibility Applications to molecular simulation Work on this paper.
Force-field-based conformational sampling & docking: status, results, issues of the project Dragos Horvath ANR (Agence Nationale de la Recherche)
Elon Yariv Graduate student in Prof. Nir Ben-Tal’s lab Department of Biochemistry and Molecular Biology, Tel Aviv University.
Genetic Algorithm. Outline Motivation Genetic algorithms An illustrative example Hypothesis space search.
Haploid-Diploid Evolutionary Algorithms
Genetic Algorithm in TDR System
Evolution Strategies Evolutionary Programming
Discrete ABC Based on Similarity for GCP
Generating, Maintaining, and Exploiting Diversity in a Memetic Algorithm for Protein Structure Prediction Mario Garza-Fabre, Shaun M. Kandathil, Julia.
Bulgarian Academy of Sciences
Meta-heuristics Introduction - Fabien Tricoire
Presented by: Dr Beatriz de la Iglesia
Rong Chen Boston University
Parallel Cooperative Optimization Research Group
Haploid-Diploid Evolutionary Algorithms
Advanced Artificial Intelligence Evolutionary Search Algorithm
Maria Okuniewski Nuclear Engineering Dept.
Genetic Algorithms: A Tutorial
Heuristic Optimization Methods Pareto Multiobjective Optimization
Ligand Docking to MHC Class I Molecules
Multi-Objective Optimization
An Integrated Approach to Protein-Protein Docking
Alexey Sulimov, Ekaterina Katkova, Vladimir Sulimov,
Volume 25, Issue 11, Pages e3 (November 2017)
○ Hisashi Shimosaka (Doshisha University)
Traveling Salesman Problem by Genetic Algorithm
Adsorption Simulations on Metal-Organic Frameworks for Air Separation
Genetic Algorithms: A Tutorial
Mr.Halavath Ramesh 16-MCH-001 Dept. of Chemistry Loyola College University of Madras-Chennai.
Mr.Halavath Ramesh 16-MCH-001 Dept. of Chemistry Loyola College University of Madras-Chennai.
Mr.Halavath Ramesh 16-MCH-001 Dept. of Chemistry Loyola College University of Madras-Chennai.
Mr.Halavath Ramesh 16-MCH-001 Dept. of Chemistry Loyola College University of Madras-Chennai.
Presentation transcript:

A new tri-objective model for the flexible docking problem J-C. BOISSON1, L. JOURDAN1, E-G. TALBI1 and D.HORVATH2 1Project Team INRIA DOLPHIN, Lille, France. 2 « Laboratoire de Glycobiologie Structurale et Fonctionnelle », CNRS, Lille1, France. J-C. BOISSON META 2008

Outline Molecular docking. ANR Dock project & Docking@GRID. A new tri-objective model. Algorithm design. Data and results. Conclusions and perspectives. 23/04/2018 J-C. BOISSON META 2008

Outline Molecular docking. ANR Dock project & Docking@GRID. A new tri-objective model. Algorithm design. Data and results. Conclusions and perspectives. 23/04/2018 J-C. BOISSON META 2008

+ Molecular docking HIV-1 PROTEASE + XK263 RECEPTOR + XK263 Inhibitor LIGAND Molecular docking  prediction of the optimal complex receptor/ligand according to chemical and geometric properties. 23/04/2018 J-C. BOISSON META 2008

Molecular docking Docking simulation: rigid  no conformation modification of the molecules. semi-flexible  one of the two molecules may have its conformation modified during the process (generally the ligand). flexible  conformational modifications for the both molecules. Several sites can exist for docking the ligand. 23/04/2018 J-C. BOISSON META 2008

Outline Molecular docking. ANR Dock project & Docking@GRID. A new tri-objective model. Algorithm design. Data and results. Conclusions and perspectives. 23/04/2018 J-C. BOISSON META 2008

ANR Dock project ANR  french research agency. Dock project  3-year project about protein structure prediction and docking. One of the objectives of the Dock project : Find new multi-objective models for the flexible docking. Implement them with effective (parallel) optimization methods. Propose these methods to the community. 23/04/2018 J-C. BOISSON META 2008

Docking@Grid: conformational sampling and docking on grids PSP = protein structure prediction Ligand files Conformations Ligand PSP User Docking Receptor PSP Receptor files Conformations More information on : http://dockinggrid.gforge.inria.fr 23/04/2018 J-C. BOISSON META 2008

Outline Molecular docking. ANR Dock project & Docking@GRID. A new tri-objective model. Algorithm design. Data and results. Conclusions and perspectives. 23/04/2018 J-C. BOISSON META 2008

A tri-objective model (1/8) An energy objective  qualify the stability of the gained complexes. A geometric objective  describe the degree of penetration of the ligand into the site. A robustness objective  ability of the complex to resist to small perturbations. A-A Tantar, N. Melab, E-G. Talbi and B. Toursel. A Parallel Hybrid Genetic Algorithm for Protein Structure Prediction on the Computational Grid. Elsevier Science, Future Generation Computer Systems, 23(3):398-409, 2007. 23/04/2018 J-C. BOISSON META 2008

A tri-objective model (2/8) 1. Ligand/site complex energy Force field used = originaly based on the Consistent Valence Force Field (CVFF) 23/04/2018 J-C. BOISSON META 2008

A tri-objective model (3/8) 2. Complex surface  3 possibilities:  Van Der Waals surface (a: blue),  solvant accessible surface (b: red),  Connolly surface (c: green). 23/04/2018 J-C. BOISSON META 2008

A tri-objective model (4/8) 2. Complex surface  3 possibilities:  Van Der Waals surface,  solvant accessible surface  Connolly surface.  SASA Solvent Accessible Surface Area Original paper S.M. Le Grand and K.M. Merz, Jr. Rapid Approximation to Molecular Surface Area via the Use of Boolean Logic and Look-Up Tables. Journal of Computational Chemistry, 14(3):349-352 (1993). Recent paper using SASA A. Leaver-Fay, G.L. Butterfoss, J. Snoeyink and B. Kuhlman. Maintaining solvent accessible surface area under rotamer substitution for protein design. Journal of Computational Chemistry, 28(8):1336-1341 (2007). 23/04/2018 J-C. BOISSON META 2008

A tri-objective model (5/8) SASA = 6201 Å2 SASA = 5548 Å2 23/04/2018 J-C. BOISSON META 2008

A tri-objective model (6/8) 3. Complex robustness G = 23/04/2018 J-C. BOISSON META 2008

A tri-objective model (7/8): sampling around optimal complex (ligand rotation) 23/04/2018 J-C. BOISSON META 2008

A tri-objective model (8/8): sampling around optimal complex (ligand translation) 23/04/2018 J-C. BOISSON META 2008

Outline Molecular docking. ANR Dock project & Docking@GRID. A new tri-objective model. Algorithm design. Data and results. Conclusions and perspectives. 23/04/2018 J-C. BOISSON META 2008

Outline Molecular docking. ANR Dock project & Docking@GRID. A new tri-objective model. Algorithm design  the genetic algorithms (GA) Data and results. Conclusions and perspectives. 23/04/2018 J-C. BOISSON META 2008

Motivation for choosing the GA Efficient multi-objective GA scheme are available. These algorithms allow to gain a set of solutions of good compromise. They have a good power of exploration of the search space. The GA are easy to parallelize. 23/04/2018 J-C. BOISSON META 2008

Solution representation Site Ligand X1 Y1 Z1 X2 Y2 Z2 X3 Y3 Z3 . XN YN ZN X’1 Y’1 Z’1 X’2 Y’2 Z’2 X’3 Y’3 Z’3 . X’N Y’N Z’N « docking complex » 23/04/2018 J-C. BOISSON META 2008

Indicator-Based EA (IBEA) [Zitzler et al. 2004] Initialization initial population P. Fitness assignment quality indicator Qi : Fitness (x) = Qi (x , P\{x}) Diversity preservation  none. Selection binary tournament. Recombination and mutation operators. Replacement remove the worst individual and update fitness values until |P| = N. Elitism archive A of potentially efficient solutions. Output archive A. 23/04/2018 J-C. BOISSON META 2008 22

Recombination operator Parents S1 + L1 S2 + L2 Children S1 + L2 S2 + L1 23/04/2018 J-C. BOISSON META 2008

Classic docking mutations Translation Rotation of a torsion angle Rotation 23/04/2018 J-C. BOISSON META 2008

Advanced docking mutations (1/2) Reverse mutation  big ligand rotation to avoid bad results due to symmetry in it. Big and small rotation/translation windows  adapting the impact of ligand rotations and translations during the docking process. SMO mutation (Several Mutations in One)  mechanism to make several modifications without evaluate an individual in order to gain access to new search space areas. 23/04/2018 J-C. BOISSON META 2008 25

Advanced docking mutation (2/2) Hybridizing mechanisms : Local search based on ligand rotations. Local search based on torsion rotations.  goal : minimizing the complex energy. (mono-objective local searches) 23/04/2018 J-C. BOISSON META 2008 26

PARAllel and DIStributed Evolving Objects http://paradiseo.gforge.inria.fr/ EO PEO MO MOEO  Evolving Object (EO) for population of solution based metaheuristics : EA, PSO.  Moving Objects (MO) for solution base metaheuristics : HC, SA, TS, ILS, VNS, …  Multi-Objective EO (MOEO) for multi-objective evolutionary algorithms : NSGA-II, SPEA, IBEA, …  ParadisEO (PEO)  EO, MO and MOEO on clusters and/or grids. S. Cahon, N. Melab and E-G. Talbi, ParadisEO: A Framework for the Reusable Design of Parallel and Distributed Metaheuristics. Journal of Heuristics, vol. 10(3), pp.357-380, May 2004. A. Liefooghe, M. Basseur, L. Jourdan and E-G. Talbi. ParadisEO-MOEO: A Framework for Multi-Objective Optimization. Proceedings of EMO’2007, pages 457-471, LNCS, Springer-Verlag, 2007. 23/04/2018 J-C. BOISSON META 2008

Performance assessment Comparison of the final complexes with the crystallographic one. Root Mean Square Deviation (RMSD) computation : with :  n the number of heavy atoms.  dx, dy and dz the deviation between complex and model structures for x, y and z coordinate. 23/04/2018 J-C. BOISSON META 2008

Outline Molecular docking. ANR Dock project & Docking@GRID. A new tri-objective model. Algorithm design. Data and results. Conclusions and perspectives. 23/04/2018 J-C. BOISSON META 2008

Data and results Tests on 6 instances of the CDCC-Astex clean list: 6rsa, 1mbi, 2tsc, 1htf, 1dog and 2mcp. Instances prepared with the Chimera software : Extraction of the ligand from the site to have a « seed » ligand used for population initialisation. Correct results obtained (average RMSD = 2 Å) but not good enough comparing to standard docking algorithms (generally < 1 Å). 23/04/2018 J-C. BOISSON META 2008

Outline Molecular docking. ANR Dock project & Docking@GRID. A new tri-objective model. Algorithm design. Data and results. Conclusions and perspectives. 23/04/2018 J-C. BOISSON META 2008

Conclusions and perspectives (1/2) A new tri-objective has been proposed. It appears to be able to give promising results on 6 instances. It needs : To be tested on other instances. To have its behaviour improved. But it is an exploratory study … 23/04/2018 J-C. BOISSON META 2008

Conclusions and perspectives (2/2) It is only one (the first) model designed. Eight multi-objective models have been designed: Bi and tri objective models. Using two different force fields: CVFF. Autodock 4.0. Tested on the same instances for twelve operator configurations of the parallel GA. 23/04/2018 J-C. BOISSON META 2008

Questions ? 23/04/2018 J-C. BOISSON META 2008