Mao, C., LaBean, T.H., Reif, J.H. & Seeman, N.C. (2000), Nature 407, 493-496. A Cumulative XOR Calculation: Assembly.

Slides:



Advertisements
Similar presentations
NSF-ITR: EIA : Structural DNA Nanotechnology
Advertisements

Simple Graph Warmup. Cycles in Simple Graphs A cycle in a simple graph is a sequence of vertices v 0, …, v n for some n>0, where v 0, ….v n-1 are distinct,
Chapter 1: Number Patterns 1.3: Arithmetic Sequences
Assembly of DNA Graphs whose Edges are Helix Axes Phiset Sa-Ardyen*, Natasa Jonoska** and Nadrian C. Seeman* *New York University, New York, NY **University.
More Efficient Generation of Plane Triangulations Shin-ichi Nakano Takeaki Uno Gunma University National Institute of JAPAN Informatics, JAPAN 23/Sep/2003.
Two States of the Array B. Ding & N.C. Seeman, Science 314, (2006).
© 2006 Pearson Addison-Wesley. All rights reserved14 A-1 Chapter 14 excerpts Graphs (breadth-first-search)
Consecutive Integer Problems. What is a consecutive integer? Integer: natural numbers and zero Integer: natural numbers and zero Consecutive: one after.
Graph Algorithms: Minimum Spanning Tree We are given a weighted, undirected graph G = (V, E), with weight function w:
What is the next line of the proof? a). Let G be a graph with k vertices. b). Assume the theorem holds for all graphs with k+1 vertices. c). Let G be a.
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.
Impact on current processes Acknowledgments Literature Cited Abstract Minimum Pots for the Usual Suspects Recent exciting advances in DNA self-assembly.
What Is the Intellectual Goal of Structural DNA Nanotechnology? Controlling the Structure of Matter in 3D to the Highest Extent (Resolution) Possible,
Physical Mapping II + Perl CIS 667 March 2, 2004.
The Steps in a Walk Sherman, W.B. & Seeman, N.C. (2004), NanoLett. 4,
Efficient DNA Construction using Minimization David Miller* and Laura Beaudin Advisors: Jo Ellis-Monaghan and Greta Pangborn.
SOLVING WORD PROBLEMS LESSON 3.
Minimum Spanning Trees. Subgraph A graph G is a subgraph of graph H if –The vertices of G are a subset of the vertices of H, and –The edges of G are a.
Solving Equations That Are Quadratic in Form Solve equations by rewriting them in quadratic form. 2.Solve equations that are quadratic in form by.
Activity 4.2 The Shot Put.
Arithmetic Sequences and Series. A sequence is arithmetic if each term – the previous term = d where d is a constant e.g. For the sequence d = 2 nd term.
Physical Mapping of DNA Shanna Terry March 2, 2004.
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.
Autonomous DNA Walking Devices Peng Yin*, Andrew J. Turberfield †, Hao Yan*, John H. Reif* * Department of Computer Science, Duke University † Department.
Beyond Silicon: Tackling the Unsolvable with DNA.
DNA-Scaffolded Self-Assembling Nano-Circuitry An Ongoing Research Project with Dr. Soha Hassoun Presentation by Brandon Lucia and Laura Smith.
DNA Based Self-Assembly and Nano-Device: Theory and Practice Peng Yin Committee Prof. Reif (Advisor), Prof. Agarwal, Prof. Hartemink Prof. LaBean, Prof.
DNA Technology - 2.
An Introduction to the Genetic Code of Life! By C. Rhein
Physical Mapping of DNA BIO/CS 471 – Algorithms for Bioinformatics.
Substitution Method: 1. Solve the following system of equations by substitution. Step 1 is already completed. Step 2:Substitute x+3 into 2 nd equation.
Review: 6.5f Mini-Quiz 1. Solve: Verify by factoring. 2. Solve by Graphing: y = x 2 – 4x. Verify by factoring.
Solving Inequalities by adding or subtracting, checking the inequality & graphing it!! This is so easy you won’t even need one of these!!!
Explorers need maps: Abstraction, representations and graphs Paul Curzon Queen Mary University of London
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.
2 Office hours: MWR 4:20-5:30 inside or just outside Elliott 162- tell me in class that you would like to attend. For those of you who cannot stay: MWR:
The Manhattan Tourist Problem Shane Wood 4/29/08 CS 329E.
Presented by Pardeep Dhillon and Ehsan Fadaei
Walks, Paths and Circuits. A graph is a connected graph if it is possible to travel from one vertex to any other vertex by moving along successive edges.
TileSoft: Sequence Optimization Software for Designing DNA Secondary Structures P. Yin*, B. Guo*, C. Belmore*, W. Palmeri*, E. Winfree †, T. H. LaBean*
Self-Assembling DNA Graphs Summarized by Park, Ji - Yoon.
OPERA highthroughput paired-end sequences Reconstructing optimal genomic scaffolds with.
Classwork Quiz Worksheet Homework (day 54) Worksheet (1-7) Walks, Paths and Circuits SOL: DM.1.
Molecular Evolutionary Computing (MEC) for Maximum Clique Problems March 9, 2004 Biointelligence Laboratory School of Computer Science and Engineering.
Computation by Self-assembly of DNA Graphs N. Jonoska, P. Sa-Ardyen, and N. Seeman Genetic Programming and Evolvable Machines, v.4, pp , 2003 Summarized.
De Bruijn sequences 陳柏澍 Novembers Each of the segments is one of two types, denoted by 0 and 1. Any four consecutive segments uniquely determine.
Non-Autonomous DNA based Nanorobotical devices
Autonomous DNA Walking Devices
Autonomous Programmable Nanorobotic Devices Using DNAzymes
What is the next line of the proof?
Partial Products Algorithm for Multiplication
B-Z Device Chengde Mao. B-Z Device Chengde Mao.
Boustrophedon Cell Decomposition
Volume 24, Issue 11, Pages e2 (November 2017)
Unit 2 Day 2 Factoring and Solving.
A Unidirectional DNA Walker Moving Autonomously Along a Track
Self-Assembling DNA Graphs
by T. M. Jacobs, B. Williams, T. Williams, X. Xu, A. Eletsky, J. F
Lecture 11 CSE 331 Sep 22, 2016.
3-1 Relations A relation is a set of points.
A Crystalline DNA Device
What happens before a cell divides?
For your classwork/homework today (cont.)
Chapter 14 Graphs © 2011 Pearson Addison-Wesley. All rights reserved.
At the Crossroads of Chemistry, Biology, and Materials
Three Dimensional DNA Structures in Computing
The Flexibility of DNA Double Crossover Molecules
Learning a hidden graph with adaptive algorithms
Autonomously designed free-form 2D DNA origami
Presentation transcript:

Mao, C., LaBean, T.H., Reif, J.H. & Seeman, N.C. (2000), Nature 407, A Cumulative XOR Calculation: Assembly

Mao, C., LaBean, T.H., Reif, J.H. & Seeman, N.C. (2000), Nature 407, A Cumulative XOR Calculation: Extracting the Answer

A Cumulative XOR Calculation: Data Mao, C., LaBean, T.H., Reif, J.H. & Seeman, N.C. (2000), Nature 407,

Assembly of Graphs Whose Edges are Helix Axes: Prototyping a Calculation Phiset Sa-Ardyen Natasha Jonoska (U. South Florida)

The Vertex 3-Colorability Problem Given a graph, color the vertices with three colors such that adjacent vertices are colored distinctly. P. Sa-Ardyen, N. Jonoska & Seeman, N.C. (2004),J. Am. Chem.Soc., 126,

Add junction molecules for the vertices and the duplex molecules for the edges. Let them hybridize and then be ligated. Treat all partially formed molecules with exonuclease and check if there is a circular molecule in the tube. A DNA Solution to the Problem. P. Sa-Ardyen, N. Jonoska & Seeman, N.C. (2004),J. Am. Chem.Soc., 126,

Components of a Graph Nodes Edges P. Sa-Ardyen, N. Jonoska & Seeman, N.C. (2004),J. Am. Chem.Soc., 126,

Design of Oligonucleotides for a Monochromatic Prototype Experiment Edges e 1,e 2,e 3,e 8 are 4 helical turns, e 3,e 4,e 7, are 6 helical turns, e 6 is 8 helical turns. No sequence of 6 nucleotides is repeated P. Sa-Ardyen, N. Jonoska & Seeman, N.C. (2004),J. Am. Chem.Soc., 126,

Junctions Used P. Sa-Ardyen, N. Jonoska & Seeman, N.C. (2004),J. Am. Chem.Soc., 126,

Edges Used P. Sa-Ardyen, N. Jonoska & Seeman, N.C. (2004),J. Am. Chem.Soc., 126,

1084 Nucleotides Vertices and Edges P. Sa-Ardyen, N. Jonoska & Seeman, N.C. (2004),J. Am. Chem.Soc., 126,

Schematic of the Graph P. Sa-Ardyen, N. Jonoska & Seeman, N.C. (2004),J. Am. Chem.Soc., 126,

Topoisomerase I Characterization of Cyclic DNA Molecules P. Sa-Ardyen, N. Jonoska & Seeman, N.C. (2004),J. Am. Chem.Soc., 126,

Single-Restriction Analysis P. Sa-Ardyen, N. Jonoska & Seeman, N.C. (2004),J. Am. Chem.Soc., 126,

Double Restriction Strategy P. Sa-Ardyen, N. Jonoska & Seeman, N.C. (2004),J. Am. Chem.Soc., 126,

Round the Clock Mapping -- 1st Set P. Sa-Ardyen, N. Jonoska & Seeman, N.C. (2004),J. Am. Chem.Soc., 126,

Round the Clock Mapping -- 2nd Set P. Sa-Ardyen, N. Jonoska & Seeman, N.C. (2004),J. Am. Chem.Soc., 126,

Round the Clock Mapping -- 3rd Set 2% > P. Sa-Ardyen, N. Jonoska & Seeman, N.C. (2004),J. Am. Chem.Soc., 126,

Round the Clock Mapping -- 4th Set 2% > P. Sa-Ardyen, N. Jonoska & Seeman, N.C. (2004),J. Am. Chem.Soc., 126,

Summary of Results Polyhedral Catenanes, Knots and Borromean Rings can be Assembled from Branched DNA by Ligation. 2D Lattices with Tunable Features have been Made from Branched DNA Components; Progress towards 3D has been made. Algorithmic Assemblies have been Prototyped; a 3-Colorability Problem has been Prototyped. Heterologous Species have been Included in DNA Nanoconstructs. Nanomechanical Devices have been Assembled from Branched DNA, including a Walker and a Translation Device. A Machine has been Incorporated into a 2D Lattice.

SUPPORT National Institute of General Medical Sciences Office of Naval Research National Science Foundation DARPA/AFOSR Army Research Office Nanoscience Technologies, Inc. WEB PAGE