Algorithmic Self-Assembly of DNA Sierpinski Triangles Ahn, Yong-Yeol 2005.5.3. Journal Club.

Slides:



Advertisements
Similar presentations
Protein Synthesis.
Advertisements

An information-bearing seed for nucleating algorithmic self-assembly Presented by : Venkata Chaitanya Goli Robert D. Barish1, Rebecca Schulman1,
Transcription Using DNA to make RNA. The “Big Picture” Goal Use DNA to make protein ▫Step 1: Replicate the DNA ▫Step 2: Transcribe DNA into RNA ▫Step.
Mansi Mavani Graduate Student Department of Physics, OSU Stillwater
Structural bioinformatics
DNA as a solution of computational problems Radosław Łazarz
Montek Singh COMP Nov 15,  Two different technologies ◦ TODAY: DNA as biochemical computer  DNA molecules encode data  enzymes, probes.
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
Ashish Goel Stanford University Joint work with Len Adleman, Holin Chen, Qi Cheng, Ming-Deh Huang, Pablo Moisset, Paul.
 Assemble the DNA  Follow base pair rules  Blue—Guanine  Red—Cytosine  Purple—Thymine  Green--Adenine.
Goal: Students will be able to explain how DNA was identified as the genetic material, describe the basic processes of replication, transcription, and.
DNA REPLICATION. Semi-conservative theory DNA molecule made up of one parental strand and one new strand.
DNA and Quantum Computers Russell Deaton Associate Professor Computer Science and Engineering University of Arkansas.
DNA Replication DNA mRNA protein transcription translation replication Before each cell division the DNA must be replicated so each daughter cell can get.
 Scientific study of life.  Present era is most exciting in biology  Scientists are trying to solve biological puzzles like:  How a single microscopic.
Optimization Based Modeling of Social Network Yong-Yeol Ahn, Hawoong Jeong.
1 Proceedings of the 24 th Annual ACM-SIAM Symposium on Discrete Algorithms January, 2013 Fuel Efficient Computation in Passive Self-Assembly Robert SchwellerUniversity.
1 Bio + Informatics AAACTGCTGACCGGTAACTGAGGCCTGCCTGCAATTGCTTAACTTGGC An Overview پرتال پرتال بيوانفورماتيك ايرانيان.
Inquiry: How is DNA used to store and transmit cell information?
Process Flowsheet Generation & Design Through a Group Contribution Approach Lo ï c d ’ Anterroches CAPEC Friday Morning Seminar, Spring 2005.
Autonomous DNA Nanomechanical Device Capable of Universal Computation and Universal Translational Motion Peng Yin*, Andrew J. Turberfield †, Sudheer Sahu*,
Strand Design for Biomolecular Computation
AP Biology Discussion Notes Wednesday 01/28/2015.
DNA Computing.  Elements of complementary nature abound in nature. Complementary parts (in nature) can “self-assemble”. A universal principle?  This.
Extra. 1Introduction 2Theoretical background Biochemistry/molecular biology 3Theoretical background computer science 4History of the field 5Splicing systems.
Molecular Computing and Evolution In Vitro Evolution In Vitro Clustering Genetic Algorithms Artificial Immune Systems Biological Evolution and Molecular.
Cellular Automata & DNA Computing 우정철. Definition Of Cellular Automata Von Von Neuman’s Neuman’s Definition Wolfram’s Wolfram’s Definition Lyman.
Predicting protein degradation rates Karen Page. The central dogma DNA RNA protein Transcription Translation The expression of genetic information stored.
What is DNA Computing? Shin, Soo-Yong Artificial Intelligence Lab.
Powering the nanoworld: DNA-based molecular motors Bernard Yurke A. J. Turberfield University of Oxford J. C. Mitchell University of Oxford A. P. Mills.
4/4/20131 EECS 395/495 Algorithmic DNA Self-Assembly General Introduction Thursday, 4/4/2013 Ming-Yang Kao General Introduction.
Program Design. The design process How do you go about writing a program? –It’s like many other things in life Understand the problem to be solved Develop.
An Introduction to Algorithmic Tile Self-Assembly.
CSCI N100 Principles of Computing Basic Problem-Solving.
BELLRINGER Put this in the second box of your Bellringer Page 1.What does “replicate” mean? 2.What is the end result of DNA replication? 3.Why.
Teaching Bioinformatics Nevena Ackovska Ana Madevska - Bogdanova.
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.
Towards Autonomous Molecular Computers Towards Autonomous Molecular Computers Masami Hagiya, Proceedings of GP, Nakjung Choi
Dna & Genetics: the building blocks of life Ariel white period 2 biology.
AP Biology Discussion Notes Wednesday 2/10/2015. Goals for Today Be able to describe how DNA & RNA molecules differ from each other. Be able to name and.
DNA Bricks Ke, Y., Ong, L. L., Shih, W. M. & Yin, P. Three-dimensional structures self- assembled from DNA bricks. Science 338, 1177–1183 (2012).
Chapter 10 Part - 1 Molecular Biology of the Gene - DNA Structure and Replication.
Bioinformatics bits of Life Dr. Tony C Smith Department of Computer Science University of Waikato
Do Now 1.Thinking back to Friday, write to the best of your ability what we did in the lab on Friday. This should be written in complete sentences. We.
DNA Replication Animation. Function of… To replicate DNA with high fidelity Must be done prior to mitosis 1 cell  2 cells, DNA content of new daughter.
AP CSP: The Need for Programming Languages and Algorithms
An Introduction to Protein Synthesis
Computational and Experimental Design of DNA Devices
Introduction to Tiling Assembly
Molecular Computation
عناصر المثلثات المتشابهة Parts of Similar Triangles
Programmable DNA Lattices: Design Synthesis & Applications
Dealing with Complexity
Tiing Error Correction & ExperimentsChen
Cellular Automata.
DNA structure and gene expression
Replication, Transcription, Translation
Protein Synthesis.
KEY CONCEPT DNA replication copies the genetic information of a cell.
Self-Assembly Ho-Lin Chen Nov
Brownian Computation Charles H. Bennett IBM Research.
Macromolecule Notes Biology Per.2.
Computational Thinking
Translation 1. Translation
Reading mRNA and synthesizing protein
Transcription Using DNA to make RNA.
Algorithms for Robust Self-Assembly
Presentation transcript:

Algorithmic Self-Assembly of DNA Sierpinski Triangles Ahn, Yong-Yeol Journal Club

Fundamental Question: How to Make a Nano-structure? In Art… Or,

To Carve

To Build or Not To Build Carving is Hard. It needs lots of energy. How about building?

Building a Nano-structure Molecules form lots of structures naturally – reducing free energy.

Building a Nano-structure Crystalization Folding (Protein, RNA) Self-assembly … We’ll ignore about the protein folding (more hard).

Self-Assembly = A Magic Wand? Can we design our own structure? It’s hard!

Why? We can not control the molecules microscopically, so there are only limited type of structures feasible.

Why? The interaction between molecules must be able to be designed accurately. We must think about the errors seriously.

DNA! T G C A

DNA If we make a sequence, only complementary-sequence can be attached.  Highly specific!  DNA is also stable and easy to make.

DNA’s new capability Adleman(1994) made a simple DNA computer which solves the problem of path finding. A B B C means there is a path from A to C.

We Can Computer with DNA By the complemetarity of the DNA. Adleman’s DNA computer is a kind of DNA self-assembly.  How about making a cellular automata with DNA self-assembly?  e.g. making an universal turing machine (=universal computer)!

Cellular Automata “Change my next state by a specific rule that is a function of neighbors’ states”.  a computer t

Algorithmic Self-assembly Can we make a self-assembly like this?

XOR: 1 if only one of the parents is 1. XOR is a simple rule but not a trivial one. Try a Simple One: XOR

XOR makes the Sierpinski Triangle XOR makes (disrete version of) the Sierpinski Triangle.  A fascinating example of global ordering from local interaction and shows the great capability of self-assembly.

How to Construct XOR? Clever… +_+

Then, How to Make it in Real? Just little modifications

Translate to DNA “1”

Another Implementation

How do they Assemble?

Experiment Anneal them from 90 ℃ to room temp. Anneal the nucleating structure (long strands) similarly. Mix them together and anneal. The molecules first form the triangle then make the crystal structure. Take pictures with AFM.

Result

Conclusion This paper shows “Algorithmic self- assembly” in reality. DNA is cool! –Designable –Stable –Easy to make