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

Slides:



Advertisements
Similar presentations
Pairwise Sequence Alignment Sushmita Roy BMI/CS 576 Sushmita Roy Sep 10 th, 2013 BMI/CS 576.
Advertisements

Energy Efficiency through Burstiness Athanasios E. Papathanasiou and Michael L. Scott University of Rochester, Computer Science Department Rochester, NY.
1 An Adaptive GA for Multi Objective Flexible Manufacturing Systems A. Younes, H. Ghenniwa, S. Areibi uoguelph.ca.
Evolving Cooperative Strategies in Multi-Agent Systems Using a Coevolutionary Algorithm Cesario C. Julaton III, Ramanathan S. Thinniyam, Una-May O’Reilly.
FOREST PLANNING USING PSO WITH A PRIORITY REPRESENTATION P.W. Brooks and W.D. Potter Institute for Artificial Intelligence, University of Georgia, USA.
Comparison of Genetic Algorithm and WASAM Model for Real Time Water Allocation: A Case Study of Song Phi Nong Irrigation Project Bhaktikul, K, Mahidol.
The Use of Linkage Learning in Genetic Algorithms By David Newman.
Chemotaxis Pathway How can physics help? Davi Ortega.
Protein Threading Zhanggroup Overview Background protein structure protein folding and designability Protein threading Current limitations.
Institute of Intelligent Power Electronics – IPE Page1 Introduction to Basics of Genetic Algorithms Docent Xiao-Zhi Gao Department of Electrical Engineering.
Optimizing genetic algorithm strategies for evolving networks Matthew Berryman.
Applying Genetic Algorithms to Decision Making in Autonomic Computing Systems Authors: Andres J. Ramirez, David B. Knoester, Betty H.C. Cheng, Philip K.
Global Optimization: For Some Problems, There’s HOPE Daniel M. Dunlavy University of Maryland, College Park Applied Mathematics and Scientific Computation.
Introduction to Genetic Algorithms Yonatan Shichel.
Mining frequent patterns in protein structures: A study of protease families Dr. Charles Yan CS6890 (Section 001) ST: Bioinformatics The Machine Learning.
1 Worst and Best-Case Coverage in Sensor Networks Seapahn Meguerdichian, Farinaz Koushanfar, Miodrag Potkonjak, Mani Srivastava IEEE TRANSACTIONS ON MOBILE.
A Comparative Study Of Deterministic And Stochastic Optimization Methods For Integrated Design Of Processes Mario Francisco a, Silvana Revollar b, Pastora.
Discovery of RNA Structural Elements Using Evolutionary Computation Authors: G. Fogel, V. Porto, D. Weekes, D. Fogel, R. Griffey, J. McNeil, E. Lesnik,
Learning from Experience: Case Injected Genetic Algorithm Design of Combinational Logic Circuits Sushil J. Louis Genetic Algorithm Systems Lab(gaslab)
Artificial Intelligence Genetic Algorithms and Applications of Genetic Algorithms in Compilers Prasad A. Kulkarni.
Genetic Algorithms Sushil J. Louis Evolutionary Computing Systems LAB Dept. of Computer Science University of Nevada, Reno
Design of Curves and Surfaces by Multi Objective Optimization Rony Goldenthal Michel Bercovier School of Computer Science and Engineering The Hebrew University.
Genetic Threading By J.Yadgari and A.Amir Published: special issue on Bioinformatics in Journal of Constraints, June 2001 Alexandre Tchourbanov University.
Stochastic Roadmap Simulation: An Efficient Representation and Algorithm for Analyzing Molecular Motion Mehmet Serkan Apaydin, Douglas L. Brutlag, Carlos.
Apparent Emissivity in the Base of a Cone Cosmin DAN, Gilbert DE MEY University of Ghent Belgium.
Genetic Algorithm What is a genetic algorithm? “Genetic Algorithms are defined as global optimization procedures that use an analogy of genetic evolution.
Coordinative Behavior in Evolutionary Multi-agent System by Genetic Algorithm Chuan-Kang Ting – Page: 1 International Graduate School of Dynamic Intelligent.
Inverse Kinematics for Molecular World Sadia Malik April 18, 2002 CS 395T U.T. Austin.
IE 607 Constrained Design: Using Constraints to Advantage in Adaptive Optimization in Manufacturing.
Construyendo modelos 3D de proteinas ‘fold recognition / threading’
1 Bio + Informatics AAACTGCTGACCGGTAACTGAGGCCTGCCTGCAATTGCTTAACTTGGC An Overview پرتال پرتال بيوانفورماتيك ايرانيان.
Practical session 2b Introduction to 3D Modelling and threading 9:30am-10:00am 3D modeling and threading 10:00am-10:30am Analysis of mutations in MYH6.
Computational protein design. Reasons to pursue the goal of protein design In medicine and industry, the ability to precisely engineer protein hormones.
Using Motion Planning to Study Protein Folding Pathways Susan Lin, Guang Song and Nancy M. Amato Department of Computer Science Texas A&M University
High Performance, Pipelined, FPGA-Based Genetic Algorithm Machine A Review Grayden Smith Ganga Floora 1.
Content of the previous class Introduction The evolutionary basis of sequence alignment The Modular Nature of proteins.
Protein Folding in the 2D HP Model Alexandros Skaliotis – King’s College London Joint work with: Andreas Albrecht (University of Hertfordshire) Kathleen.
Doshisha Univ. JapanGECCO2002 Energy Minimization of Protein Tertiary Structure by Parallel Simulated Annealing using Genetic Crossover Takeshi YoshidaTomoyuki.
De novo Protein Design Presented by Alison Fraser, Christine Lee, Pradhuman Jhala, Corban Rivera.
Genetic Algorithms Genetic algorithms imitate a natural optimization process: natural selection in evolution. Developed by John Holland at the University.
Doshisha Univ., Japan Parallel Evolutionary Multi-Criterion Optimization for Block Layout Problems ○ Shinya Watanabe Tomoyuki Hiroyasu Mitsunori Miki Intelligent.
Modern Heuristic Optimization Techniques and Potential Applications to Power System Control Mohamed A El-Sharkawi The CIA lab Department of Electrical.
Introduction to Evolutionary Algorithms Session 4 Jim Smith University of the West of England, UK May/June 2012.
A Survey of Protein Folding in HP Model Presented by: T.K. Yu 2003/7/24
FINAL EXAM SCHEDULER (FES) Department of Computer Engineering Faculty of Engineering & Architecture Yeditepe University By Ersan ERSOY (Engineering Project)
15/06/2003NORPIE 2004, Trondheim1 Genetic Optimization of Electric Machines, a State of the Art Study S. E. Skaar, R. Nilssen.
Approximation Algorithms For Protein Folding Prediction Giancarlo MAURI,Antonio PICCOLBONI and Giulio PAVESI Symposium on Discrete Algorithms, pp ,
Protein Structure Prediction
Center for Biological Physics* Arjan van der Vaart – studying the conformational changes of proteins as they interact with other molecules Banu Ozkan –
Chapter 12 FUSION OF FUZZY SYSTEM AND GENETIC ALGORITHMS Chi-Yuan Yeh.
Data and Knowledge Engineering Laboratory Clustered Segment Indexing for Pattern Searching on the Secondary Structure of Protein Sequences Minkoo Seo Sanghyun.
PROTEIN FOLDING: H-P Lattice Model 1. Outline: Introduction: What is Protein? Protein Folding Native State Mechanism of Folding Energy Landscape Kinetic.
Fixed parameter algorithms for protein similarity search under mRNA structure constrains A joint work by: G. Blin, G. Fertin, D. Hermelin, and S. Vialette.
A survey of Constraint Handling Techniques in Evolutionary Computation Methods Author: Zbigneiw Michalewicz Presenter: Masoud Mazloom 27 th Oct
Innovative and Unconventional Approach Toward Analytical Cadastre – based on Genetic Algorithms Anna Shnaidman Mapping and Geo-Information Engineering.
Two Finger Caging of Concave Polygon Peam Pipattanasomporn Advisor: Attawith Sudsang.
September 28, 2000 Improved Simultaneous Data Reconciliation, Bias Detection and Identification Using Mixed Integer Optimization Methods Presented by:
Visually Demonstrating the Principles of Protein Folding Bill McClung, Jeff Schwehm, Greg Wolffe.
Structural classification of Proteins SCOP Classification: consists of a database Family Evolutionarily related with a significant sequence identity Superfamily.
We propose an accurate potential which combines useful features HP, HH and PP interactions among the amino acids Sequence based accessibility obtained.
Advanced AI – Session 6 Genetic Algorithm By: H.Nematzadeh.
Global topology optimization of truss structures Dmitrij Šešok Rimantas Belevičius Department of Engineering Mechanics. Vilnius Gediminas Technical University.
Genetic Algorithm. Outline Motivation Genetic algorithms An illustrative example Hypothesis space search.
Structural Bioinformatics Yasaman Karami Master BIM-BMC Semestre 3, Laboratoire de Biologie Computationnelle et Quantitative (LCQB) e-documents:
Bioinformatics Overview
Evolutionary Technique for Combinatorial Reverse Auctions
Author :Shigeomi HARA Hiroshi DOUZONO Yoshio NOGUCHI
Determine protein structure from amino acid sequence
HPD Model for Protein Structure Simulation
謝孫源 (Sun-Yuan Hsieh) 成功大學 電機資訊學院 資訊工程系
Presentation transcript:

Protein Structure Prediction With Evolutionary Algorithms Natalio Krasnogor, U of the West of England William Hart, Sandia National Laboratories Jim Smith, U of the West of England David Pelta, Universidad de Granada Presenter: Elena Zheleva

Introduction Problem Description Biology Background – Protein Folding – HP Protein Folding Model Genetic Algorithm (GA) Design Factors – Encodings for Internal Coordinates – Potential Energy Formulation – Constraint Management Methods and Results Conclusion

Problem Description Computational Biology open problem: protein structure prediction Genetic algorithms have been used in the research literature Authors analyze 3 algorithm parameters that impact performance and behavior of GAs Goal: make suggestions for future algorithm design

Outline Problem Description Biology Background – Protein Folding – HP Protein Folding Model GA Design Factors – Encodings for Internal Coordinates – Potential Energy Formulation – Constraint Management Methods and Results Conclusion

Protein Folding Proteins: driving force behind all of the biochemical reactions which make biology work Protein is an amino acid chain! Amino acid chain -> Structure of a protein Structure of a protein -> Function of a protein

Protein Folding Protein Folding: connection between the genome (sequence) and what the proteins actually do (their function). Currently, no reliable computational solution for protein folding (3D structure) problem. Chemistry, Physics, Biology, CS

Outline Problem Description Biology Background – Protein Folding – HP Protein Folding Model GA Design Factors – Encodings for Internal Coordinates – Potential Energy Formulation – Constraint Management Methods and Results Conclusion

HP Protein Folding Model Amino acid chains (proteins) are represented as connected beads on a 2D or 3D lattice HP: hydrophobic – hydrophilic property Hydrophobic amino acids can form a hydrophobic core w/ energy potential

HP Protein Folding Model Model adds energy value e to each pair of hydrophobics that are adjacent on lattice AND not consecutive in the sequence Goal of GA: find low energy configurations!

Outline Problem Description Biology Background – Protein Folding – HP Protein Folding Model GA Design Factors – Encodings for Internal Coordinates – Potential Energy Formulation – Constraint Management Methods and Results Conclusion

Encodings for Internal Coordinates Proteins are represented using internal coordinates (vs. Cartesian) Absolute vs. Relative encoding Absolute Encoding: specifies an absolute direction cubic lattice: {U,D,L,R,F,B} Relative Encoding: specifies direction relative to the previous amino acid cubic lattice: {U,D,L,R,F} n-1

Encodings for Internal Coordinates Encoding impacts global search behavior of GA Example: One-point Mutations Relative Encoding: FLLFRRLRLLR-> FLLFRFLRLLR Absolute Encoding: RULLURURULU-> RULLUULULDL

Outline Problem Description Biology Background – Protein Folding – HP Protein Folding Model GA Design Factors – Encodings for Internal Coordinates – Potential Energy Formulation – Constraint Management Methods and Results Conclusion

Potential Energy Formulation Problem: same energy but different potential (Picture ) Augment energy function to allow a distance- dependent hydrophobic-hydrophobic potential (Formula)

Outline Problem Description Biology Background – Protein Folding – HP Protein Folding Model GA Design Factors – Encodings for Internal Coordinates – Potential Energy Formulation – Constraint Management Methods and Results Conclusion

Constraint Management Methods for penalizing infeasible conformations Method 1: Consider only feasible conformations – Weakness: shortest path from one feasible conformation to another may be very long Method 2: Fixed Penalty Approach – Violations: 2 amino acids lying on the same lattice point Lattice point at which there are 2 or more amino acids – Penalty per violation = 2*number of hydrophobics + 2 (any infeasible conformation has positive energy)

Outline Problem Description Biology Background – Protein Folding – HP Protein Folding Model GA Design Factors – Encodings for Internal Coordinates – Potential Energy Formulation – Constraint Management Methods and Results Conclusion

Methods and Results 1-point and 2-point Mutation operators 1-point, 2-point and Uniform Crossover operators 5 polymer sequences (< 50 amino acids) Each run of GA: 200 generations

Methods and Results Relative vs. Absolute Encoding (Diagram ) Distribution of relative ranks on the 3 lattices

Methods and Results Standard vs. Distant Energy Does the modified energy potential improve the search capabilities of the GA? No significant difference on test sequences A guess: there might be on longer sequences

Conclusion GAs applied to Protein Structure Prediction problem have 3 important factors to consider Relative encoding is at least as good as absolute encoding, in some cases much better Modified energy potential does not improve search capabilities of GA The proposed constraint/penalty method ensures feasibility of the optimal solution

PE (Post Exhibitum)

PE