POA Simulation 2004.5.25 MEC Seminar 임희웅.

Slides:



Advertisements
Similar presentations
Alex Zelikovsky Department of Computer Science Georgia State University Joint work with Serghei Mangul, Irina Astrovskaya, Bassam Tork, Ion Mandoiu Viral.
Advertisements

Bilal Gonen, Murat Yuksel, Sushil Louis University of Nevada, Reno.
Simulated Annealing General Idea: Start with an initial solution
CS 678 –Boltzmann Machines1 Boltzmann Machine Relaxation net with visible and hidden units Learning algorithm Avoids local minima (and speeds up learning)
Thermodynamic Models of Gene Regulation Xin He CS598SS 04/30/2009.
An evolutionary Monte Carlo algorithm for predicting DNA hybridization Joon Shik Kim et al. (2008) (Fri) Computational Modeling of Intelligence.
CS 678 –Relaxation and Hopfield Networks1 Relaxation and Hopfield Networks Totally connected recurrent relaxation networks Bidirectional weights (symmetric)
Probabilities Random Number Generators –Actually pseudo-random –Seed Same sequence from same seed Often time is used. Many examples on web. Custom random.
Randomized Algorithms for the Loop Cutset Problem Author: Ann Becker, Beuven Bar-Yehuda Dan Geiger Beuven Bar-Yehuda Dan Geiger Class presentation for.
Improving Free Energy Functions for RNA Folding RNA Secondary Structure Prediction.
Selection of Optimal DNA Oligos for Gene Expression Arrays Reporter : Wei-Ting Liu Date : Nov
Travelling Salesman Problem an unfinished story...
Initial Pool Generation Based on DNA Shuffling Method Eun-jeong Lee.
Elements of the Heuristic Approach
Genetic Algorithms and Ant Colony Optimisation
Free energies and phase transitions. Condition for phase coexistence in a one-component system:
Strand Design for Biomolecular Computation
The Fidelity of the Tag-Antitag System J. A. Rose, R. J. Deaton, M. Hagiya, And A. Suyama DNA7 poster Summarized by Shin, Soo-Yong.
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.
Non-Photorealistic Rendering and Content- Based Image Retrieval Yuan-Hao Lai Pacific Graphics (2003)
CSE 589 Part VI. Reading Skiena, Sections 5.5 and 6.8 CLR, chapter 37.
DNA Computing in Microreactors Danny van Noort, Frank-Ulich Gast and John S. McCaskill Biomolecular Information Processing, GMD, Germany Lee Ji Youn.
A PCR-based Protocol for In Vitro Selection of Non-Crosshybridizing Oligonucleotides R. Deaton, J. Chen, H. Bi, M. Garzon, H. Rubin and D. H. Wood.
1 Genetic Algorithms and Ant Colony Optimisation.
Simulated Annealing G.Anuradha.
CSC321: Introduction to Neural Networks and Machine Learning Lecture 18 Learning Boltzmann Machines Geoffrey Hinton.
Cell and Microbial Engineering Laboratory Solving TSP on Lab-on-a-Chip 1 Jiyoun Lee.
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.
Community Detection Algorithms: A Comparative Analysis Authors: A. Lancichinetti and S. Fortunato Presented by: Ravi Tiwari.
Computational and experimental analysis of DNA shuffling : Supporting text N. Maheshri and D. V. Schaffer PNAS, vol. 100, no. 6, Summarized by.
Chapter 18 Connectionist Models
Global Tracking for CBM Andrey Lebedev 1,2 Ivan Kisel 1 Gennady Ososkov 2 1 GSI Helmholtzzentrum für Schwerionenforschung GmbH, Darmstadt, Germany 2 Laboratory.
Lecture 9 State Space Gradient Descent Gibbs Sampler with Simulated Annealing.
A global approach Finding correspondence between a pair of epipolar lines for all pixels simultaneously Local method: no guarantee we will have one to.
CS621: Artificial Intelligence
The Multistrand Simulator: Stochastic Simulation of the Kinetics of Multiple Interacting DNA Strands Joseph Schaeffer, Caltech (slides by John Reif)
Parallel Simulated Annealing using Genetic Crossover Tomoyuki Hiroyasu Mitsunori Miki Maki Ogura November 09, 2000 Doshisha University, Kyoto, Japan.
Molecular Evolutionary Computing (MEC) for Maximum Clique Problems March 9, 2004 Biointelligence Laboratory School of Computer Science and Engineering.
Arne Thesen and Akachai Jantayavichit Slide 1 A new approach to tolerance improvement through real-time selective assembly Arne Thesen and Akachai Jantayavichit.
Systematic errors of MC simulations Equilibrium error averages taken before the system has reached equilibrium  Monitor the variables you are interested.
1 Summarized by Ji Youn Lee. 2 Model Development.
Contents Introduction Bus Power Model Related Works Motivation
The History of ARM and Microcontrollers Chapter 1
Evolutionary Algorithms Jim Whitehead
Learning Deep Generative Models by Ruslan Salakhutdinov
Simulated Annealing Chapter
Markov Random Fields with Efficient Approximations
Summarized by In-Hee Lee
Wet (DNA) computing 2001년 9월 20일 이지연
Subject Name: Operation Research Subject Code: 10CS661 Prepared By:Mrs
Arne Thesen and Akachai Jantayavichit
Power and limits of reactive intelligence
Example: Applying EC to the TSP Problem
Haim Kaplan and Uri Zwick
DNA Library Design for Molecular Computation
Computational and experimental analysis of DNA shuffling
Great Ideas in Computing Average Case Analysis
JSPS Project on Molecular Computing (presentation by Masami Hagiya)
المشرف د.يــــاســـــــــر فـــــــؤاد By: ahmed badrealldeen
Fitness measures for DNA Computing
DNA Hybridization Catalysts and Catalyst Circuits
Boltzmann Machine (BM) (§6.4)
I can describe events using probability near 0, ½, or 1 on a number line? I can explain the difference between theoretical and experimental probability.
Russell Deaton, junghuei Chen, hong Bi, and John A. Rose
DNA Solution of the Maximal Clique Problem
Bioinformatics, Vol.17 Suppl.1 (ISMB 2001)
Nearest-neighbor model for Tm
Chem 291C Draft Sample Preliminary Seminar
New Weight Encoding Method -FRET-
Lecture 2-6 Complexity for Computing Influence Spread
Presentation transcript:

POA Simulation 2004.5.25 MEC Seminar 임희웅

Contents Introduction Algorithm and Workflow Architecture and Environment Result Discussion Reference

Introduction Lee et al. DNA10, 2004 Inside of POA Prediction of experimental result without real experiment 23 city TSP Information for experimental setup

Algorithm and Workflow Simplified version of Maheshri et al.(2003) Random selection and collision model Selection with a probability proportional to the number of corresponding DNA. (roulette-wheel selection) Annealing event probability by Gibbs free energy and NN model No gapped annealing or bulge Consider only match sections Sum of all the free energy in match sections Boltzmann-weighted probability for each annealing event

Workflow

Architecture and Environment

Result (1) Cycle 10 Cycle 20 Cycle 30 Cycle 6 Cycle 5 Cycle 1 Cycle2

Result (2) 100 200 300

Discussion Fidelity of POA? Annealing temperature Validity of NN model Low extension efficiency in later cycle Unextendable hybridization Annealing temperature Annealing temperature gradient? (low  high) Validity of NN model

Reference J. Santalucia, Jr. A unified view of polymer, dumbbell, and oligonucleotide DNA nearest-neighbor thermodynamics, PNAS, 1998 N. Maheshri, et al. Computational and experimental analysis of DNA shuffling, PNAS, 2003, and its supplement J. Y. Lee, et al Efficient initial pool generation for weighted graph problems using parallel overlap assembly, DNA10, 2004