TileSoft: Sequence Optimization Software for Designing DNA Secondary Structures P. Yin*, B. Guo*, C. Belmore*, W. Palmeri*, E. Winfree †, T. H. LaBean*

Slides:



Advertisements
Similar presentations
In Silico Primer Design and Simulation for Targeted High Throughput Sequencing I519 – FALL 2010 Adam Thomas, Kanishka Jain, Tulip Nandu.
Advertisements

In the name of GOD. Zeinab Mokhtari 22-Sep-2010 Angew. Chem. Int. Ed. 2006, 45, 735 –739 Finite-Size, Fully Addressable DNA Tile Lattices Formed by Hierarchical.
INTRODUCTION TO SIMULATION WITH OMNET++ José Daniel García Sánchez ARCOS Group – University Carlos III of Madrid.
Design of a biomolecular Device that executes process Algebra Urmi Majumder and John Reif Department of Computer Science Duke University DNA15, JUNE 10,
1 An Adaptive GA for Multi Objective Flexible Manufacturing Systems A. Younes, H. Ghenniwa, S. Areibi uoguelph.ca.
1 A Balanced Introduction to Computer Science, 2/E David Reed, Creighton University ©2008 Pearson Prentice Hall ISBN Chapter 17 JavaScript.
STATISTICAL PACKAGE FOR AUGMENTED DESIGNS
Prediction to Protein Structure Fall 2005 CSC 487/687 Computing for Bioinformatics.
Guide to Oracle10G1 Introduction To Forms Builder Chapter 5.
ADVISE: Advanced Digital Video Information Segmentation Engine
Geometric Crossover for Biological Sequences Alberto Moraglio, Riccardo Poli & Rolv Seehuus EuroGP 2006.
Topics in Biological Physics Design and self-assembly of two-dimensional DNA crystals Benny Gil 16/12/08 Fig3.a.
THE BRIEF PSYCHIATRIC RATING SCALE SYSTEM Senior Project by John Newman.
Academic Advisor: Prof. Ronen Brafman Team Members: Ran Isenberg Mirit Markovich Noa Aharon Alon Furman.
DNA: Not Merely the Secret of Life Bio-Inspired Bottom-Up Nanoscale Control of the Structure of Matter Nadrian C. Seeman Department of Chemistry New.
Hierarchical GUI Test Case Generation Using Automated Planning Atif M. Memon, Student Member, IEEE, Martha E. Pollack, and Mary Lou Soffa, Member, IEEE.
Geometric Crossovers for Supervised Motif Discovery Rolv Seehuus NTNU.
Introduction To Form Builder
Optical Communication System Design Software
Creating a MagicInfo Pro Screen Template
Optimization of thermal processes2007/2008 Optimization of thermal processes Maciej Marek Czestochowa University of Technology Institute of Thermal Machinery.
Genetic Programming.
Fig. 12-2, p.187. Fig. 12-5, p.190 Fig. 12-6, p nanometer diameter overall 0.34-nanometer distance between each pair of bases 3.4-nanometer length.
Introduction to LEKIN Gareth Beddoe
Interactive Input Methods & Graphical User Input
Autonomous DNA Nanomechanical Device Capable of Universal Computation and Universal Translational Motion Peng Yin*, Andrew J. Turberfield †, Sudheer Sahu*,
The Design of Autonomous DNA Nanomechanical Devices: Walking and Rolling John H. Reif Duke University.
CGMB214: Introduction to Computer Graphics
Strand Design for Biomolecular Computation
Slides are based on Negnevitsky, Pearson Education, Lecture 12 Hybrid intelligent systems: Evolutionary neural networks and fuzzy evolutionary systems.
DNA Based Self-Assembly and Nano-Device: Theory and Practice Peng Yin Committee Prof. Reif (Advisor), Prof. Agarwal, Prof. Hartemink Prof. LaBean, Prof.
EE 492 ENGINEERING PROJECT LIP TRACKING Yusuf Ziya Işık & Ashat Turlibayev Yusuf Ziya Işık & Ashat Turlibayev Advisor: Prof. Dr. Bülent Sankur Advisor:
Rubicon ATLAS A Basic User’s Manual.
Molecular Computations Using Self-Assembled DNA Nanostructures and Autonomous Motors John H. Reif Department of Computer Science, Duke University 1.
Reusability and Effective Test Automation in Telecommunication System Testing Mikael Mattas Supervisor: Professor Sven-Gustav Häggman Instructor: B.Sc.
Neural Networks for Protein Structure Prediction Brown, JMB 1999 CS 466 Saurabh Sinha.
Boltzmann Machine (BM) (§6.4) Hopfield model + hidden nodes + simulated annealing BM Architecture –a set of visible nodes: nodes can be accessed from outside.
ECEN/MAE 3723 – Systems I MATLAB Lecture 2. Lecture Overview What is Simulink? How to use Simulink  Getting Start with Simulink  Building a model Example.
Evolving Virtual Creatures & Evolving 3D Morphology and Behavior by Competition Papers by Karl Sims Presented by Sarah Waziruddin.
Playing Biology ’ s Name Game: Identifying Protein Names In Scientific Text Daniel Hanisch, Juliane Fluck, Heinz-Theodor Mevissen and Ralf Zimmer Pac Symp.
Automated Patch Generation Adapted from Tevfik Bultan’s Lecture.
 Genetic Algorithms  A class of evolutionary algorithms  Efficiently solves optimization tasks  Potential Applications in many fields  Challenges.
COT 6930 HPC and Bioinformatics Multiple Sequence Alignment Xingquan Zhu Dept. of Computer Science and Engineering.
Whiplash PCR History: - Invented by Hagiya et all 1997] - Improved by Erik Winfree Made Isothermal by John Reif and Urmi Majumder 2008 Whiplash.
Coevolutionary Automated Software Correction Josh Wilkerson PhD Candidate in Computer Science Missouri S&T.
A Software Tool for Generating Non-Crosshybridizing libraries of DNA Oligonucleotides Russell Deaton, junghuei Chen, hong Bi, and John A. Rose Summerized.
Chapter 5 Introduction To Form Builder. Lesson A Objectives  Display Forms Builder forms in a Web browser  Use a data block form to view, insert, update,
ANU comp2110 Software Design lecture 8 COMP2110 Software Design in 2004 lecture 8 Software Architecture 1 of 2 (design, lecture 3 of 6) Goal of this small.
John Reif and Urmi Majumder Department of Computer Science Duke University Isothermal Reactivating Whiplash PCR for Locally Programmable Molecular Computation.
Solution of Satisfiability Problem on a Gel-Based DNA computer Ji Yoon Park Dept. of Biochem Hanyang University.
1 Autonomic Computer Systems Evolutionary Computation Pascal Paysan.
Genetic algorithms: A Stochastic Approach for Improving the Current Cadastre Accuracies Anna Shnaidman Uri Shoshani Yerach Doytsher Mapping and Geo-Information.
Onlinedeeneislam.blogspot.com1 Design and Analysis of Algorithms Slide # 1 Download From
Molecular Computation: RNA Solutions to Chess Problems Proceedings of the National Academy of Science (PNAS), vol. 97, no. 4, pp , February 15,
Active-HDL Server Farm Course 11. All materials updated on: September 30, 2004 Outline 1.Introduction 2.Advantages 3.Requirements 4.Installation 5.Architecture.
Microsoft Visual Basic 2012: Reloaded Fifth Edition Chapter One An Introduction to Visual Basic 2012.
DNASequenceGenerator: A Program for the construction of DNA sequences Udo Feldkamp, Sam Saghafi, Wolfgang Banzhaf, Hilmar Rauhe DNA7 pp Summarized.
March 1, 2016Introduction to Artificial Intelligence Lecture 11: Machine Evolution 1 Let’s look at… Machine Evolution.
 Negnevitsky, Pearson Education, Lecture 12 Hybrid intelligent systems: Evolutionary neural networks and fuzzy evolutionary systems n Introduction.
Computational and Experimental Design of DNA Devices
ECEN/MAE 3723 – Systems I MATLAB Lecture 2.
Solution of Satisfiability Problem on a Gel-Based DNA computer
Computer Programming.
Programmable DNA Lattices: Design Synthesis & Applications
CIS16 Application Development Programming with Visual Basic
DNA Library Design for Molecular Computation
Boltzmann Machine (BM) (§6.4)
Russell Deaton, junghuei Chen, hong Bi, and John A. Rose
Topology Optimization through Computer Aided Software
Autonomously designed free-form 2D DNA origami
Presentation transcript:

TileSoft: Sequence Optimization Software for Designing DNA Secondary Structures P. Yin*, B. Guo*, C. Belmore*, W. Palmeri*, E. Winfree †, T. H. LaBean* and J. H. Reif* Summarized by HaYoung Jang 1

DNA is a crucial construction material for molecular scale objects with nano-scale features. Diverse synthetic DNA objects hold great potential for applications such as nano-fabrication, nano-robotics, nano-computing, and nano-electronics. The construction of DNA objects is generally carried out via self-assembly. During self-assembly, DNA strands are guided by their sequence information into secondary structures to maximize Watson-Crick pairing of their bases and thus minimize the free energy of the resultant structures. A crucial computational problem in constructing DNA objects is the design of DNA sequences that can correctly assemble into desired DNA secondary structures. However, existing software packages only provide unintuitive text-line interfaces and generally require the user to step through the entire sequence selection process, which could be time-consuming and tedious. In contrast, TileSoft described here deliver the following features: Its graphical user interface renders the molecular architect the ability to define DNA secondary structure and accompanying designing constraints directly on the interface as well as the ability to view the optimized sequence information pictorially. Its fully automatic optimization module, which uses an evolutionary algorithm built on top of DNADesign by E. Winfree, relieves the user of the drudgery of manually dictating the sequence selection process, and its evolutionary algorithm produces satisfactory results efficiently. Its graphical user interface and its optimization module are smoothly integrated from user's perspective, while they are at the same time well separated in terms of software architecture, making each amenable to future improvements without negatively affecting the other. Abstract 2

Motivation: Designing DNA tiles 3 DX latticeRhombus latticeTX lattice4x 4 lattice Barcode lattice DNA as nano-construction material Self-assembly as bottom-up nano-construction method DNA lattices made of DNA tiles, i.e. smaller DNA secondary nanostructure units Design process: 1.Template design 2.Sequence selection (optimization) DX tiles TX tiles

Prior work v.s. TileSoft 4 DNA word design software: Produce a pool of DNA sequences such that each sequence is of maximal difference from others Sequin: Generate DNA sequences that uniquely assemble into desired secondary structures Text line interface for inputting template and displaying optimized sequences Sequence optimization process only semi-automated TileSoft: Available at Generate DNA sequences that uniquely assemble into desired secondary structures Graphical interface for inputting template and displaying optimized structure (GUI Module) Sequence optimization process fully automated (Optimization Module) GUI Module and Optimization Module smoothly integrated for end users, yet well separated in software architecture

Tile Set Design Procedure 5 Topological structure of each single tile Constraints on the DNA sequences: The complementary of pairing sticky ends The specific enzyme recognition sites The specification of the base composition of the junctions

GUI: Default window 6

GUI: Define Crossover 7 The user can define crossovers between helices, by clicking sequentially the two bases to be connected in 5' to 3' order.

GUI: Set 5’ end; set 3’ end 8 Set 5’ endSet 3’ end By setting the 5' end and 3' end of a DNA strand, the user specifies the length of the strand, and the unused segment of the strand is deleted automatically (showed in color gray).

GUI: Edit base 9 The user can directly input the base values for a strand by typing; Typing more than one character edits consecutive bases in the 5' to 3' direction along the strand

GUI: Set non-Waston-Crick base pairing 10 The user can define the subsequences that are not required to be Watson-Crick base paired by clicking on the starting and ending bases of the subsequences.

GUI: Set and show EQ constraint 11 Set EQ constraintShow EQ constraint Set EQ constraint: Clicking on two bases in one strand defines the starting and ending points of the first sub-sequence, and a click on another base delineates the second sub-sequence with the same length and direction as the first one. Show EQ Constraint: A small window is brought up that contains multiple buttons, with each representing a set of equal sub-sequences. When one of these buttons is clicked, the corresponding sub-sequences will be highlighted in purple.

The optimization module is developed based on DNADesign by E. Winfree. The optimization module enhances DNADesign employs an evolutionary algorithm to find the best solution to the optimization objective function. Evolutionary algorithm: An evolutionary algorithm maintains a population of DNA sequences, which are generated randomly during initialization. During selection, the fittest DNA sequences are chosen for reproduction, based on their score according to the objective function. These individuals are used to generate new individuals via mutations and crossovers, and the newly produced individuals are reinserted into the population. The process is repeated until meeting some termination condition. Objective function as in DNADesign: The objective function consists of two weighted factors, the count of unwanted complementary sequences spurious matches (as the sequence-symmetry minimization algorithm used in Sequin) and the count of to-be-avoided sub- sequences, e.g. long AT runs. Optimization module 12

GUI: Geometrically more flexible structures Make the number of helices and number of bases per helix user specifiable Optimization: Multiple parallel traces of optimization process with different starting points A pre-optimized library Incorporate parameters such as hybridization temperature and software modules such as BIND A new heuristic that performs optimization based on existing pre-optimized duplex libraries Other: Curvature analyzer (S. H. Park, Duke Physics ) Make the software more robust Future work 13