An information-bearing seed for nucleating algorithmic self-assembly Presented by : Venkata Chaitanya Goli 651366318 Robert D. Barish1, Rebecca Schulman1,

Slides:



Advertisements
Similar presentations
Automata Theory Part 1: Introduction & NFA November 2002.
Advertisements

Ashish Goel, 1 A simple analysis Suppose complementary DNA strands of length U always stick, and those of length L never stick (eg:
Strict Self-Assembly of Discrete Sierpinski Triangles James I. Lathrop, Jack H. Lutz, and Scott M. Summers Iowa State University © James I. Lathrop, Jack.
Models for Quasicrystal Growth By Gus Wheeler & Jehan Shams.
Recombinant DNA Technology
Noise, Information Theory, and Entropy (cont.) CS414 – Spring 2007 By Karrie Karahalios, Roger Cheng, Brian Bailey.
1 SODA January 23, 2011 Temperature 1 Self-Assembly: Deterministic Assembly in 3D and Probabilistic Assembly in 2D Matthew CookUniversity of Zurich and.
Grey Level Enhancement Contrast stretching Linear mapping Non-linear mapping Efficient implementation of mapping algorithms Design of classes to support.
Mining for High Complexity Regions Using Entropy and Box Counting Dimension Quad-Trees Rosanne Vetro, Wei Ding, Dan A. Simovici Computer Science Department.
13-2 Manipulating DNA.
Jong-Sun Yi 1. Molecular self-assembly Many top down processes create patterns serially and require extreme conditions. (vacuum, temperature, etc.) Bottom-up,
Topic 2.5 Enzymes IB Biology S. Dosman.
Self-Assembly Ho-Lin Chen Nov Self-Assembly is the process by which simple objects autonomously assemble into complexes. Geometry, dynamics,
Topics in Biological Physics Design and self-assembly of two-dimensional DNA crystals Benny Gil 16/12/08 Fig3.a.
DNA Computing by Self Assembly  Erik Winfree, Caltech.
Sunmin Ahn Journal Club Presentation October 23, 2006
Testing an individual module
Unit 1 Biology Notes Characteristics of Life
Ashish Goel Stanford University Joint work with Len Adleman, Holin Chen, Qi Cheng, Ming-Deh Huang, Pablo Moisset, Paul.
WORKSHOP (1) Presented by: Afsaneh Bazgir Polymerase Chain Reaction
Matthew J. Patitz Explorations of Theory and Programming in Self-Assembly Matthew J. Patitz Department of Computer Science University of Texas-Pan American.
Introduction and Overview DNA origami is a self-assembling system, an ideal anchor for nano- electronic devices. The scaffold of the DNA is a single strand.
CS1Q Computer Systems Lecture 8
CS1Q Computer Systems Lecture 11 Simon Gay. Lecture 11CS1Q Computer Systems - Simon Gay2 The D FlipFlop A 1-bit register is called a D flipflop. When.
1 Compact Error-Resilient Computational DNA Tiling Assemblies John H.Reif, Sudheer Sahu, and Peng Yin Presenter: Seok, Ho-SIK.
DNA The molecule of heredity. The molecules of DNA is the information for life (determine an organism’s traits) DNA achieves its control by determining.
Cellular Automata & DNA Computing 우정철. Definition Of Cellular Automata Von Von Neuman’s Neuman’s Definition Wolfram’s Wolfram’s Definition Lyman.
Algorithmic self-assembly for nano-scale fabrication Erik Winfree Computer Science Computation & Neural Systems and The DNA Caltech DARPA NSF NASA.
Molecular Self-Assembly: Models and Algorithms Ashish Goel Stanford University MS&E 319/CS 369X; Research topics in optimization; Stanford University,
1 Ch. 1: Software Development (Read) 5 Phases of Software Life Cycle: Problem Analysis and Specification Design Implementation (Coding) Testing, Execution.
Soft Computing Lab. Dept. Computer Science Yonsei Univ. Korea Self-replication from random parts 30 Mar. 2010, Keunhyun Oh Saul Griffith, Dan Goldwater,
Section 2: Replication of DNA
Algorithmic Self-Assembly of DNA Sierpinski Triangles Ahn, Yong-Yeol Journal Club.
Software Development Problem Analysis and Specification Design Implementation (Coding) Testing, Execution and Debugging Maintenance.
An Introduction to Algorithmic Tile Self-Assembly.
Polymerase Chain Reaction A process used to artificially multiply a chosen piece of genetic material. May also be known as DNA amplification. One strand.
Software Quality Assurance and Testing Fazal Rehman Shamil.
Ashish Goel, 1 The Source of Errors: Thermodynamics Rate of correct growth ¼ exp(-G A ) Probability of incorrect growth ¼ exp(-G A.
1 David DotyCalifornia Institute of Technology Matthew J. PatitzUniversity of Texas Pan-American Dustin ReishusUniversity of Southern California Robert.
NANO TECHNOLOGY. Something to think about Imagine being able to cure cancer by drinking a medicine stirred into your favorite fruit juice. Imagine a supercomputer.
Chapter 6 Chemical Reactions. Matter and Change Changes in matter can be described in terms of physical changes and chemical changes. A physical property.
CS151 Introduction to Digital Design Chapter 5: Sequential Circuits 5-1 : Sequential Circuit Definition 5-2: Latches 1Created by: Ms.Amany AlSaleh.
1 35 th International Colloquium on Automata, Languages and Programming July 8, 2008 Randomized Self-Assembly for Approximate Shapes Robert Schweller University.
Objectives Explain the concept of reaction mechanism. Use the collision theory to interpret chemical reactions. Define activated complex. Relate activation.
Section 2: Replication of DNA
Unit 2.1: BASIC PRINCIPLES OF HUMAN GENETICS
Developing DNA nanotechnology for use in nanoelectronics
Copyright Pearson Prentice Hall
PCR TECHNIQUE
Section 2: Replication of DNA
Context-based Data Compression
Introduction to Tiling Assembly
DNA Replication.
Chapter 14 Bioinformatics—the study of a genome
Paul Rothemund’s Scaffolded DNA Origami Method
Section 2: Replication of DNA
Polymerase Chain Reaction (PCR) technique
Tiing Error Correction & ExperimentsChen
Unit 2.1: BASIC PRINCIPLES OF HUMAN GENETICS
Strict Self-Assembly of Discrete Sierpinski Triangles
Copyright Pearson Prentice Hall
Self-Assembly Ho-Lin Chen Nov
Combinatorial Optimization Problems in Self-Assembly (Given a shape, output an “efficient” tile-system for assembling it)
Copyright Pearson Prentice Hall
The Power of Nondeterminism in Self-Assembly
Copyright Pearson Prentice Hall
Dr. Israa ayoub alwan Lec -12-
Algorithmic self-assembly with DNA tiles
Copyright Pearson Prentice Hall
Algorithms for Robust Self-Assembly
Presentation transcript:

An information-bearing seed for nucleating algorithmic self-assembly Presented by : Venkata Chaitanya Goli Robert D. Barish1, Rebecca Schulman1, Paul W. K. Rothemund, and Erik Winfree2

Outline Overview Preparation Experiments Techniques used and Results Principles for Success Future research topics

Overview Explaining the Title Information – bearing Seed Information in a seed molecule can determine which form is grown as well as where and when. Self- assembly Self-assembly creates natural mineral, chemical, and biological structures of great complexity. This phenomena can be exploited to program the growth of complex structures, as demonstrated by the algorithmic self-assembly of DNA tiles.

Overview What is a seed ? Controlled growth using Nucleation Barrier Mineral and chemical compounds Simplest form seeded growth Multicellular development, where genomic information in the zygote directs the algorithmic construction of the entire organism

Preparation Key features to be present for a seed : Sufficiently well-formed Capable of being synthesized with arbitrary information Straightforward to implement experimentally. high error rates, high spontaneous nucleation rates and low yields of well-formed structures. Single-stranded DNA Finite-sized tile assemblies Self-assembled ribbon-like crystals incorporating significant amounts of specific information into such seeds remains prohibitive Problems

Preparation Each DNA tile consists of multiple strands folded into a rigid unit typically displaying 4 single-stranded sticky ends that direct the tiles binding interactions with other tiles. DNA Tile

Preparation Origami DNA seed Tile Adapters Scaffold strand 192 Staple strands 32 Adapter strands Consists

Preparation Tiling theory A tile is a geometrical shape, such as a jigsaw puzzle piece, that may be assembled with other tiles based on local matching rules. Problems : Go beyond familiar fixed size random arrangements like fractals, binary trees, cellular automata Thats where I come in

Preparation The self-assembly process begins with an initial seed tile to which additional tiles can attach if they make sufficiently many Program - The starting materials, i.e. a set of available tiles.. matching contacts So to summarize in simple terms Input - The seed Output - The structure produced by self-assembly is the output.

Experiments Experiment 1 (Temperature-dependent ): To test the growth Steps : 1) All strands for the seed and for the tile set are mixed together in buffer 2) Heated to 90 °C 3)Annealed slowly to room temperature. 4) The process of self assembly is observed

Experiments At temperature 90 °C - 60 °C At these temperatures, the DNA double helix is unstable and dissociates into its single- stranded form All the stick ends are inert and dont show any binding properties.

Experiments At temperature 60 °C - 40 °C At these temperatures, the seed and individual tiles become stable because of extensive contacts between strands Tiles do not attach to the seed nor to each other because the two additional sticky-end contacts formed by each tile attachment are not thermodynamically favorable at these temperatures and concentrations.

Experiments At temperature 40 °C - 20 °C At slightly lower temperatures, below the crystal melting temperature, slightly supersaturated conditions are achieved. The attachment of a tile by two matching sticky ends becomes favorable, but attachment by a single matching sticky end remains unfavorable Consequently, tiles now attach to the origami seed and then attach to each other to grow a crystal

Experiments Experiment 2 (Width - Dependent ): Used a DNA tile set

Experiments Experiment 2 (Width - Dependent ): This tile set is added a nucleation barrier under some controlled conditions

Experiments Experiment 2 (Width - Dependent ): This tile set is added a nucleation barrier under some controlled conditions A sample Zig-Zag pair

Experiments Experiment 2 (Width - Dependent ): The sequence formed from the tile formation

Experiments Experiment 2 (Width - Dependent ): A copy tile Set is created to maintain the bonding in a desired manner.

Experiments Experiment 2 (Width - Dependent ): Additional tiles for the Copy tile set. Inset shows how correct copying of information at bit boundaries depends on preferred attachment of tiles matching two sticky ends over tiles matching just one. 1* 1 1 5* 4 4

Experiments Experiment 2 (Width - Dependent ): Binary counter Tile sets

Experiments Experiment 2 (Width - Dependent ): Carry Bit 1-Block and Carry Bit 0-Block are added to the Copy tile set The gray double tile is replaced by the beige one, whose sticky end provides the initial carry bit for each new COUNT layer. 1* 1 2* Gray Tile Replacement

Observations from the experiment: The rate of spontaneous nucleation decreases dramatically with width, and so, when the tiles are annealed without a seed, we expect the majority of crystals to be just 4 tiles wide. when annealed in the presence of seeds whose adapter tiles specify a particular width ribbon, we expect crystals of the specified width will grow off the seed even before 4-wide ribbons nucleate spontaneously.

Experiments Observations with 8 width Origami: Experiment 3 (Origami seed size): Magnified image of at the ribbon

Experiments Observations with 10 width Origami: Experiment 3 (Origami seed size): Magnified image of at the ribbon

Experiments Observations with 12 width Origami: Experiment 3 (Origami seed size): Magnified image of at the ribbon

Observations from the experiment: Within ribbons, information was copied with an error rate of 0.13% per tile. The most significant errors were those that changed the width of the ribbon, either by an internal lattice defect or by a double tile attaching too early, causing a premature reversal of the zig-zag path. Examination of errors on the first layer of the ribbon, where tiles attach directly to tile adapters, revealed that nucleation is not perfect The copying error rate increased to 8% per tile and width-changing errors increased to 6% per layer.

Observations from the experiment: 0-Block tiles appear gray 1-Block tiles appear white

Observations from the experiment: Fig F shows that the 1 block tiles are stopped

Observations from the experiment: The yellow part shows the error

Principles behind the success: Each tile set was capable of generating an infinite variety of distinct structures, a precondition for programmability A designed nucleation barrier prevented the spontaneous assembly of tiles in slightly supersaturated conditions, clearing the way for high-yield seeded growth with low error rates. Information contained in the seed was propagated, and sometimes processed, during crystal growth, enacting a simple developmental program.

The problems observed The rate of copying errors that changed 1 to 0 was 5–10 times higher than errors changing 0 to 1 Premature reversal errors and spurious nucleation errors could be reduced by adding an independent nucleation barrier on the other edge of the ribbon Aggregation of crystals must be reduced. Implementing improved proofreading techniques (39) should further reduce logical error rates and larger block sizes may reduce internal lattice defects.

The Future Research topics The More efficient algorithm whose error rate is minimum that can compute the algorithmic complex structure of the seeded growth. More efficient tiles like origami rectangles which can be used to develop the structure or of even more complex organism. Getting the knowledge of combining the nanoparticles with the DNA can further help in developing new products in the field of nanotechnology