DNA structure simulation based on sequence-structure relationship HaYoung Jang 2002. 5. 15.

Slides:



Advertisements
Similar presentations
Simulazione di Biomolecole: metodi e applicazioni giorgio colombo
Advertisements

Formulation of an algorithm to implement Lowe-Andersen thermostat in parallel molecular simulation package, LAMMPS Prathyusha K. R. and P. B. Sunil Kumar.
Molecular Dynamics: Review. Molecular Simulations NMR or X-ray structure refinements Protein structure prediction Protein folding kinetics and mechanics.
Computational methods in molecular biophysics (examples of solving real biological problems) EXAMPLE I: THE PROTEIN FOLDING PROBLEM Alexey Onufriev, Virginia.
An image-based reaction field method for electrostatic interactions in molecular dynamics simulations Presented By: Yuchun Lin Department of Mathematics.
Chemotaxis Pathway How can physics help? Davi Ortega.
Protein Threading Zhanggroup Overview Background protein structure protein folding and designability Protein threading Current limitations.
Molecular Evolution Revised 29/12/06
Case Studies Class 5. Computational Chemistry Structure of molecules and their reactivities Two major areas –molecular mechanics –electronic structure.
Biophysical Chemistry Gel Electrophoresis. Definition Electro = Charge + Phorsesis= Carry Electrophoresis = Separation of charged molecules by differences.
How many transcripts does it take to reconstruct the splice graph? Introduction Alternative splicing is the process by which a single gene may be used.
. Class 1: Introduction. The Tree of Life Source: Alberts et al.
Evaluation of Fast Electrostatics Algorithms Alice N. Ko and Jesús A. Izaguirre with Thierry Matthey Department of Computer Science and Engineering University.
Summary Protein design seeks to find amino acid sequences which stably fold into specific 3-D structures. Modeling the inherent flexibility of the protein.
Testing Bridge Lengths The Gadsden Group. Goals and Objectives Collect and express data in the form of tables and graphs Look for patterns to make predictions.
Protein Tertiary Structure Prediction
Artificial Chemistries – A Review Peter Dittrich, Jens Ziegler, and Wolfgang Banzhaf Artificial Life 7: , 2001 Summarized by In-Hee Lee.
Algorithms and Software for Large-Scale Simulation of Reactive Systems _______________________________ Ananth Grama Coordinated Systems Lab Purdue University.
DNA Computing on a Chip Mitsunori Ogihara and Animesh Ray Nature, vol. 403, pp Cho, Dong-Yeon.
Beyond Silicon: Tackling the Unsolvable with DNA.
Protein Folding in the 2D HP Model Alexandros Skaliotis – King’s College London Joint work with: Andreas Albrecht (University of Hertfordshire) Kathleen.
Bioinformatics 2011 Molecular Evolution Revised 29/12/06.
Hidden Markov Models BMI/CS 776 Mark Craven March 2002.
A Realization of Information Gate by Using Enterococcus faecalis Pheromone System Kenichi Wakabayashi and Masayuki Yamamura Preliminary Proceedings of.
2.6 Structure of DNA and RNA Topic 2: DNA, DNA Replication & Protein Synthesis 2.6 – 2.7.
Biomolecular Computation in Virtual Test Tubes 7 th International Meeting on DNA Based Computers, p75-83, June 10-13, 2001 Max Garzon, Chris Oehmen Summarized.
Artificial Intelligence Chapter 4. Machine Evolution.
Molecular simulation methods Ab-initio methods (Few approximations but slow) DFT CPMD Electron and nuclei treated explicitly. Classical atomistic methods.
What is DNA Computing? Shin, Soo-Yong Artificial Intelligence Lab.
Structure, Dynamics and Energetics of siRNA-Cationic Vector Complexation: A Molecular Dynamics Study Defang Ouyang a,b, Hong Zhang a, Harendra Parekh b.
Self-organized Models of Selectivity in Ca and Na Channels Bob Eisenberg 1, Dezső Boda 2, Janhavi Giri 1,3, James Fonseca 1, Dirk Gillespie 1, Douglas.
Introduction to Protein Structure Prediction BMI/CS 576 Colin Dewey Fall 2008.
A Chinese Postman Problem Based on DNA Computing Z. Yin, F. Zhang, and J. Xu* J. Chem. Inf. Comput. Sci. 2002, 42, Summarized by Shin, Soo-Yong.
Computational and experimental analysis of DNA shuffling : Supporting text N. Maheshri and D. V. Schaffer PNAS, vol. 100, no. 6, Summarized by.
The Inference via DNA Computing Piort Wasiewicz et al. Proceedings of the 1999 Congress on Evolutionary Computation, vol. 2, pp Cho, Dong-Yeon.
1 Biological Computing – DNA solution Presented by Wooyoung Kim 4/8/09 CSc 8530 Parallel Algorithms, Spring 2009 Dr. Sushil K. Prasad.
Solving Function Optimization Problems with Genetic Algorithms September 26, 2001 Cho, Dong-Yeon , Tel:
Nonlinear differential equation model for quantification of transcriptional regulation applied to microarray data of Saccharomyces cerevisiae Vu, T. T.,
Towards Autonomous Molecular Computers Towards Autonomous Molecular Computers Masami Hagiya, Proceedings of GP, Nakjung Choi
Protein Structure Prediction: Threading and Rosetta BMI/CS 576 Colin Dewey Fall 2008.
Image Charge Optimization for the Reaction Field by Matching to an Electrostatic Force Tensor Wei Song Donald Jacobs University of North Carolina at Charlotte.
A Computational Study of RNA Structure and Dynamics Rhiannon Jacobs and Dr. Harish Vashisth Department of Chemical Engineering, University of New Hampshire,
A Computational Study of RNA Structure and Dynamics Rhiannon Jacobs and Harish Vashisth Department of Chemical Engineering, University of New Hampshire,
Artificial Intelligence Project 2 Genetic Algorithms
PNA-mediated Whiplash PCR
Optimization Based Design of Robust Synthetic
1 Department of Engineering, 2 Department of Mathematics,
Algorithms and Software for Large-Scale Simulation of Reactive Systems
Artificial Intelligence Chapter 4. Machine Evolution
1 Department of Engineering, 2 Department of Mathematics,
1 Department of Engineering, 2 Department of Mathematics,
Gene expression profiling diagnosis through DNA molecular computation
Subhayu Basu et al. , DNA8, (2002) MEC Seminar Su Dong Kim
Artificial Intelligence Chapter 20 Learning and Acting with Bayes Nets
List a Carbohydrate Monomer
DNA computing on surfaces
Artificial Intelligence Chapter 4. Machine Evolution
Chapter 20. Learning and Acting with Bayes Nets
Simulation of Hybridization
Algorithms and Software for Large-Scale Simulation of Reactive Systems
Experimental Overview
Molecular Genetic Programming
2.6 Structure of DNA and RNA
Nearest-neighbor model for Tm
New tricks for modelers from the crystallography toolkit: the particle mesh Ewald algorithm and its use in nucleic acid simulations  Tom Darden, Lalith.
DNA Solution of Hard Computational Problems
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:

DNA structure simulation based on sequence-structure relationship HaYoung Jang

© 2002, SNU BioIntelligence Lab, DNA computing – Is it true? Massive parallelism of DNA computing make it possible to solve the NP-problem. - On the weight of computations, Jadas Hartmanis, 1995 Adleman says “I solved Hamiltonial Path Problem with DNA in only seven days, even though it had just four node.” - Molecular computation: Adleman's experiment repeated, Kaplan et al., 1995

© 2002, SNU BioIntelligence Lab, What is sequence-structure relationship? Intrinsic curvature that can be induced by a variety of base sequences. A-tracts - reduced electrophoretic mobility on polyacrylamide gels - enhanced ring closure probabilities

© 2002, SNU BioIntelligence Lab, Why is sequence-structure relationship important? Biology - DNA contains many signals. These signals are contained in the base sequence, but they are expressed through local DNA structure and flexibility. DNA computing - more efficient sequence design - from tube to individual

© 2002, SNU BioIntelligence Lab, Is it Possible? Ion Interaction in the grooves of DNA - MD simulation shows it. DNA Bending - Subsequent experimental investigations found intrinsic curvature of the polyadenine stretch(A-tract) Environmental Dependence of Nucleic Acid Structure - MD simulation with Particle Mesh Ewald Method Varied DNA Structures - MD simulation suggests stable state

© 2002, SNU BioIntelligence Lab, Why don’t use MD simulation? It’s too expensive. It does not suggest any model. It have been designed for dynamics.

© 2002, SNU BioIntelligence Lab, It have to… Suggest approximate model for DNA structure. Consider the time step and choose best one which represents the structure of specific base sequence. Be able to use experimental result. Be able to compute in reasonable cose.

© 2002, SNU BioIntelligence Lab, How can we do? Periodicity Artifacts

© 2002, SNU BioIntelligence Lab, How can we do? (continued.) Minimal Solvation Models  Implicit solvent models - generalized Born methodologies for treating the implicit solvation electrostatic interactions in nucleic acid simulation - Poison-Boltzmann methods in MD simulation.  Minimally including explicit solvent in MD simulation.

© 2002, SNU BioIntelligence Lab, How can we do? (continued.) Genetic Algorithm. - construct model for sequence-structure relationship - use fitness function made from simple MD algorithm and experimental result. Machine Learning - make and improve fitness function using experimental data.

© 2002, SNU BioIntelligence Lab, Present Objectives Find an appropriate MD algorithms. Determine the range of parameters. - effect of solvent. (temperature, charged ion, etc.) - range of basepair How to encode the fitness function. What kind of learning algorithm is used.