Doshisha Univ. JapanGECCO2002 Energy Minimization of Protein Tertiary Structure by Parallel Simulated Annealing using Genetic Crossover Takeshi YoshidaTomoyuki.

Slides:

Advertisements

Similar presentations

24th may Use of genetic algorithm for designing redundant sensor network Carine Gerkens Systèmes chimiques et conception de procédés Département.

Advertisements

Divided Range Genetic Algorithms in Multiobjective Optimization Problems Tomoyuki HIROYASU Mitsunori MIKI Sinya WATANBE Doshisha University.

DETERMINATION OF UNSTEADY CONTAINER TEMPERATURES DURING FREEZING OF THREE-DIMENSIONAL ORGANS WITH CONSTRAINED THERMAL STRESSES Brian Dennis Aerospace Engineering.

Protein Threading Zhanggroup Overview Background protein structure protein folding and designability Protein threading Current limitations.

Protein Structure Prediction With Evolutionary Algorithms Natalio Krasnogor, U of the West of England William Hart, Sandia National Laboratories Jim Smith,

Global Optimization: For Some Problems, There's HOPE Daniel M. Dunlavy Sandia National Laboratories, Albuquerque, NM, USA Dianne P. O’Leary Dept. of Computer.

Global Optimization: For Some Problems, There’s HOPE Daniel M. Dunlavy University of Maryland, College Park Applied Mathematics and Scientific Computation.

MAE 552 – Heuristic Optimization Lecture 6 February 6, 2002.

Task Assignment and Transaction Clustering Heuristics.

A Comparative Study Of Deterministic And Stochastic Optimization Methods For Integrated Design Of Processes Mario Francisco a, Silvana Revollar b, Pastora.

Mossbauer Spectroscopy in Biological Systems: Proceedings of a meeting held at Allerton House, Monticello, Illinois. Editors: J. T. P. DeBrunner and E.

1 Protein Structure Prediction Reporter: Chia-Chang Wang Date: April 1, 2005.

Physics of Protein Folding. Why is the protein folding problem important? Understanding the function Drug design Types of experiments: X-ray crystallography.

Genetic Algorithm What is a genetic algorithm? “Genetic Algorithms are defined as global optimization procedures that use an analogy of genetic evolution.

By Rohit Ray ESE 251.  Most minimization (maximization) strategies work to find the nearest local minimum  Trapped at local minimums (maxima)  Standard.

Elements of the Heuristic Approach

Optimization of thermal processes2007/2008 Optimization of thermal processes Maciej Marek Czestochowa University of Technology Institute of Thermal Machinery.

Inverse Kinematics for Molecular World Sadia Malik April 18, 2002 CS 395T U.T. Austin.

Bioinf. Data Analysis & Tools Molecular Simulations & Sampling Techniques117 Jan 2006 Bioinformatics Data Analysis & Tools Molecular simulations & sampling.

Geometry Optimisation Modelling OH + C 2 H 4 *CH 2 -CH 2 -OH CH 3 -CH 2 -O* 3D PES.

Parallel Genetic Algorithms with Distributed-Environment Multiple Population Scheme M.Miki T.Hiroyasu K.Hatanaka Doshisha University,Kyoto,Japan.

Empirical energy function Summarizing some points about typical MM force field In principle, for a given new molecule, all force field parameters need.

Ranga Rodrigo April 6, 2014 Most of the sides are from the Matlab tutorial. 1.

JM - 1 Introduction to Bioinformatics: Lecture XVI Global Optimization and Monte Carlo Jarek Meller Jarek Meller Division of Biomedical.

Efficient Model Selection for Support Vector Machines

Conformational Sampling

Computational protein design. Reasons to pursue the goal of protein design In medicine and industry, the ability to precisely engineer protein hormones.

A New Model of Distributed Genetic Algorithm for Cluster Systems: Dual Individual DGA Tomoyuki HIROYASU Mitsunori MIKI Masahiro HAMASAKI Yusuke TANIMURA.

A Comparison of Nature Inspired Intelligent Optimization Methods in Aerial Spray Deposition Management Lei Wu Master’s Thesis Artificial Intelligence Center.

MOGADES: Multi-Objective Genetic Algorithm with Distributed Environment Scheme Intelligent Systems Design Laboratory ， Doshisha University ， Kyoto Japan.

A new Approach to Structural Prediction of Proteins Heiko Schröder Bertil Schmidt Jiujiang Zhu School of Computer Engineering Nanyang Technological University.

Optimization in Engineering Design Georgia Institute of Technology Systems Realization Laboratory Mixed Integer Problems Most optimization algorithms deal.

Protein Folding in the 2D HP Model Alexandros Skaliotis – King’s College London Joint work with: Andreas Albrecht (University of Hertfordshire) Kathleen.

ProteinShop: A Tool for Protein Structure Prediction and Modeling Silvia Crivelli Computational Research Division Lawrence Berkeley National Laboratory.

Bioinformatics: Practical Application of Simulation and Data Mining Protein Folding I Prof. Corey O’Hern Department of Mechanical Engineering & Materials.

Zorica Stanimirović Faculty of Mathematics, University of Belgrade

Doshisha Univ., Japan Parallel Evolutionary Multi-Criterion Optimization for Block Layout Problems ○ Shinya Watanabe Tomoyuki Hiroyasu Mitsunori Miki Intelligent.

Distributed Genetic Algorithms with a New Sharing Approach in Multiobjective Optimization Problems Tomoyuki HIROYASU Mitsunori MIKI Sinya WATANABE Doshisha.

Department of Mechanical Engineering

Doshisha Univ., Kyoto, Japan CEC2003 Adaptive Temperature Schedule Determined by Genetic Algorithm for Parallel Simulated Annealing Doshisha University,

Conformational Entropy Entropy is an essential component in ΔG and must be considered in order to model many chemical processes, including protein folding,

C OMPARING T HREE H EURISTIC S EARCH M ETHODS FOR F UNCTIONAL P ARTITIONING IN H ARDWARE -S OFTWARE C ODESIGN Theerayod Wiangtong, Peter Y. K. Cheung and.

Protein Structure Prediction

A Parallel Genetic Algorithm with Distributed Environment Scheme

Vaida Bartkutė, Leonidas Sakalauskas

ECE 103 Engineering Programming Chapter 52 Generic Algorithm Herbert G. Mayer, PSU CS Status 6/4/2014 Initial content copied verbatim from ECE 103 material.

Probabilistic Algorithms Evolutionary Algorithms Simulated Annealing.

ZEIT4700 – S1, 2015 Mathematical Modeling and Optimization School of Engineering and Information Technology.

Ramakrishna Lecture#2 CAD for VLSI Ramakrishna

Tamaki Okuda ● Tomoyuki Hiroyasu 　 Mitsunori Miki 　 Shinya Watanabe 　

- Divided Range Multi-Objective Genetic Algorithms -

►Search and optimization method that mimics the natural selection ►Terms to define ٭ Chromosome – a set of numbers representing one possible solution ٭

Protein Structure Prediction: Threading and Rosetta BMI/CS 576 Colin Dewey Fall 2008.

Parallel Simulated Annealing using Genetic Crossover Tomoyuki Hiroyasu Mitsunori Miki Maki Ogura November 09, 2000 Doshisha University, Kyoto, Japan.

Genetic Algorithm(GA)

Hirophysics.com The Genetic Algorithm vs. Simulated Annealing Charles Barnes PHY 327.

Digital Optimization Martynas Vaidelys.

A Comparison of Simulated Annealing and Genetic Algorithm Approaches for Cultivation Model Identification Olympia Roeva.

By Rohit Ray ESE 251 Simulated Annealing.

Maria Okuniewski Nuclear Engineering Dept.

Thank you chairperson for introducing me.

Doshisha Univ., Kyoto Japan

Temperature Parallel Simulated Annealing with Adaptive Neighborhood for Continuous Optimization problem Mitsunori MIKI Tomoyuki HIROYASU Masayuki KASAI.

○　Hisashi Shimosaka (Doshisha University)

New Crossover Scheme for Parallel Distributed Genetic Algorithms

Xin-She Yang, Nature-Inspired Optimization Algorithms, Elsevier, 2014

Tomoyuki HIROYASU Mitsunori MIKI Masahiro HAMASAKI Yusuke TANIMURA

Md. Tanveer Anwar University of Arkansas

Energy Minimization of Protein Tertiary Structure by Parallel Simulated Annealing using Genetic Crossover Doshisha University, Kyoto, Japan Takeshi Yoshida.

Mitsunori MIKI Tomoyuki HIROYASU Takanori MIZUTA

Presentation transcript:

Doshisha Univ. JapanGECCO2002 Energy Minimization of Protein Tertiary Structure by Parallel Simulated Annealing using Genetic Crossover Takeshi YoshidaTomoyuki Hiroyasu Mitsunori MikiMaki Ogura Doshisha University, Kyoto, Japan Yuko Okamoto Institute for Molecular Science, Aichi, Japan Doshisha Univ. Japan GECCO2002

Doshisha Univ. Japan GECCO2002 Background Protein tertiary structure is closely related with biological function. lead to development new medicines. lead to manifestation mechanism of pathology. Prediction of protein tertiary structure Molecular simulation high searching ability need huge calculate time Apply Heuristic method to this problem.

Doshisha Univ. Japan GECCO2002 Protein Tertiary Structure Energy function of protein Folding protein to stable state Tertiary StructureAmino acid array Analyzing structure as Optimization problem Protein structure naturally exist with lowest energy Protein is composed of an array with 20 amino acids. Amino acid array is folding to the lowest energy

Doshisha Univ. Japan GECCO2002 Simulated Annealing High temperature Local minimum Global minimum Low temperature By the parameters, SA’s searching point moves to worse a state in a certain probability. T : Temperature of current step Probability; P = － (E next － E current ) T exp SA is often applied to prediction of Protein tertiary structure. SA has parameters, those are a temperature and a step.

Doshisha Univ. Japan GECCO2002 Energy function of Protein Minimum in local area Energy function of Protein has many minima in local area And a few minima in global area. Minimum in global area No success result has ever prediction of protein using SA

Doshisha Univ. Japan GECCO2002 Purpose of this study Parallel SA using Genetic Crossover(PSA/GAc) Genetic Algorithm(GA) is good at searching a solution in a wider area.(global search) Parallel SA GA operation + PSA/GAc is a hybrid method of SA with GA operation Simulated Annealing(SA) is good at searching a solution in narrower area.(local search) PSA/GAc is good at searching not only locally but also globally. We apply PSA/GAc to Protein tertiary structure.

Doshisha Univ. Japan GECCO2002 Modeling of Protein tertiary structure Design variable : dihedral angle between main chain and side chain. Minimize energy function of protein Protein is composed of an array with 20 amino acids. Changing dihedral angle dihedral angle

Doshisha Univ. Japan GECCO2002 PSA/GAc PSA/GAc is based on Parallel SA. SA crossover SA crossover end temperaturehighlow nnn n : crossover interval Searching points : individualsTotal number of SA : Population size Genetic Crossover is used to exchange the information of individuals. n

Doshisha Univ. Japan GECCO2002 PSA/GAc Genetic Crossover is performed as follows. e.q continuous optimization problem(3 dimensions) 123 parent1 123 parent2 crossover child1 child2 cross point energy Next searching points

Doshisha Univ. Japan GECCO2002 PSA/GAc PSA/GAc is based on Parallel SA. SA crossover SA crossover end temperaturehighlow nnn n : crossover interval Searching points : individualsTotal number of SA : Population size Each process reduce temperature from high to low as parameter of SA. n

Doshisha Univ. Japan GECCO2002 Target Protein Structures C-peptide ; 13 amino acids In case of using ECEPP/2 program, Protein for numerical example Lowest-energy conformation E < - 42 kcal/mol [okamoto,1991] 64 dihedral angles Design variables There are 64 times annealing per 1MCsweep C-peptide structure

Doshisha Univ. Japan GECCO2002 Num of Processors Parameters Parameter Population size Initial temperature Crossover interval Range size Value 2.0(100k) (50K) 32 6 Last temperature 180( ) We tried two types of simulations. Simulation1 : 4164 MCsweeps and 10 trials. (100,000 MCsweeps totally) Simulation2 : MCsweeps and 7 trials.

Doshisha Univ. Japan GECCO2002 Optimum [Okamoto, 1991] Result : Energy PSA/GAc Simulation1 Energy (kcal/mol) To derive a good solution, PSA/GAc with long MCsweep annealing is more effective than small Mcsweep annealing. PSA/GAc Simulation Simulation Type PSA/GAc has high searching ability in predicting protein tertiary structure problem

Doshisha Univ. Japan GECCO2002 Result : Protein structure Simulation1: kcal/mol To derive a good solution, PSA/GAc with long MCsweep annealing is more effective than small Mcsweep annealing. Simulation2: kcal/mol PSA/GAc has high searching ability in the prediction of protein tertiary structure.

Doshisha Univ. Japan GECCO2002 Conclusion This study show a new hybrid method, Parallel Simulated Annealing using Genetic Crossover(PSA/GAc). We apply PSA/GAc to energy function of protein, this result shows that PSA/GAc has good searching ability for prediction of protein tertiary structure. PSA/GAc has follow features use Genetic crossover to exchange the information between the individuals is good at searching not only locally but also globally. is based on Parallel SA, so calculate time is less than sequential SA.