The Steps in a Walk Sherman, W.B. & Seeman, N.C. (2004), NanoLett. 4, 1203-1207.

Slides:



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

Active Tile Self Assembly: Daria Karpenko Department of Mathematics and Statistics, University of South Florida Simulating Cellular Automata at Temperature.
1 SODA January 23, 2011 Temperature 1 Self-Assembly: Deterministic Assembly in 3D and Probabilistic Assembly in 2D Matthew CookUniversity of Zurich and.
The side walks of New York. A friend of yours is having a party in her Manhattan apartment, which borders Central Park. She gives you the following directions.
Lecture 21 Paths and Circuits CSCI – 1900 Mathematics for Computer Science Fall 2014 Bill Pine.
Two States of the Array B. Ding & N.C. Seeman, Science 314, (2006).
Mansi Mavani Graduate Student Department of Physics, OSU Stillwater
DNA as a solution of computational problems Radosław Łazarz
Abstract: Self-assembly is beginning to be seen as a practical vehicle for computation. The assembly of DNA-based tiles into 2D periodic arrays had been.
Text Chapters 1, 2. Sorting ä Sorting Problem: ä Input: A sequence of n numbers ä Output: A permutation (reordering) of the input sequence such that:
DNA Computing by Self Assembly  Erik Winfree, Caltech.
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,
Mao, C., LaBean, T.H., Reif, J.H. & Seeman, N.C. (2000), Nature 407, A Cumulative XOR Calculation: Assembly.
Simple Bulged 3-Arm Junction Triangle (1996) J. Qi, X. Li, X. Yang & N.C. Seeman, J. Am. Chem. Soc., 118, (1996).
1 Programmable Self-Assembled DNA-Based Autonomous Molecular Devices John Reif Duke University DNA Nanostructure Group John H Reif & Thomas H. LaBean Graduate.
A Framework for Modeling DNA Based Nanorobotical Devices
A Unidirectional DNA Walker Moving Autonomously Along a Track
The Tile Complexity of Linear Assemblies Dept of Computer Science, Duke University Harish Chandran, Nikhil Gopalkrishnan, John Reif { harish, nikhil, reif.
Using Dijkstra’s Algorithm to Find a Shortest Path from a to z 1.
Social Feature-based Multi-path Routing in Delay Tolerant Networks
Autonomous DNA Walking Devices Peng Yin*, Andrew J. Turberfield †, Hao Yan*, John H. Reif* * Department of Computer Science, Duke University † Department.
DNA Based Self-Assembly and Nano-Device: Theory and Practice Peng Yin Committee Prof. Reif (Advisor), Prof. Agarwal, Prof. Hartemink Prof. LaBean, Prof.
DNA Self-Assembly for Molecular Patterning, Computation and Robotics John H. Reif Computer Science Department Duke University.
“Graph theory” for the master degree program “Geographic Information Systems” Yulia Burkatovskaya Department of Computer Engineering Associate professor.
computer
Molecular Computations Using Self-Assembled DNA Nanostructures and Autonomous Motors John H. Reif Department of Computer Science, Duke University 1.
Algorithmic self-assembly for nano-scale fabrication Erik Winfree Computer Science Computation & Neural Systems and The DNA Caltech DARPA NSF NASA.
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.
Algorithmic Self-Assembly of DNA Sierpinski Triangles Ahn, Yong-Yeol Journal Club.
DNA Computing and Assembly
Lecture 16: Graph Theory III Discrete Mathematical Structures: Theory and Applications.
Towards Autonomous Molecular Computers Towards Autonomous Molecular Computers Masami Hagiya, Proceedings of GP, Nakjung Choi
Sudheer Sahu Department of Computer Science, Duke University Advisor: Prof. John Reif Committee: Prof. John Board, Prof. Alex Hartemink, Prof. Thom LaBean,
Copyright © 2008 Pearson Education, Inc. Slide 13-1 Unit 13B The Traveling Salesman Problem.
1.5.3 Walkthrough #4 bouncing_ball.py wrapping_ball.py
ПЕЧЕНЬ 9. Закладка печени в период эмбрионального развития.
Dynamic Programming - DP December 18, 2014 Operation Research -RG 753.
Complexity of Graph Self-Assembly in Accretive Systems and Self-Destructible Systems Peng Yin Joint with John H. Reif and Sudheer Sahu 1 Department of.
ΜΕΤΑΣΥΛΛΕΚΤΙΚΗ ΦΥΣΙΟΛΟΓΙΑ ΕΡΓΑΣΤΗΡΙΟ 3. Μετασυλλεκτική Εργ3-Λιοσάτου Γ.2 ΒΙΟΛΟΓΙΚΟΙ ΠΑΡΑΓΟΝΤΕΣ ΠΟΥ ΕΠΗΡΕΑΖΟΥΝ ΤΗ ΦΘΟΡΑ ΤΩΝ ΟΠΩΡΟΚΗΠΕΥΤΙΚΩΝ Αναπνοή Η λειτουργία.
Generalizing Patterns: Table Tiles
Molecular Algorithms -- Overview
Non-Autonomous DNA based Nanorobotical devices
Autonomous DNA Walking Devices
Autonomous Programmable Nanorobotic Devices Using DNAzymes
ASSIGNMENT NO.-2.
Frontiers of Computer Science, DOI: /s y
B-Z Device Chengde Mao. B-Z Device Chengde Mao.
Molecular Computation
Programmable DNA Lattices: Design Synthesis & Applications
Self-Assembly of Shapes at Constant Scale Using Repulsive Forces
תצפית.
Compact Error Resilient Computational DNA Tiling Assemblies
Genome Assembly.
Foundations of Discrete Mathematics
Computational Complexity
اثرات گرمايش جهاني تغييرات آب و هوا، تأثيرات عميق و شديدي بر بسياري از عوامل اساسي موثر بر سلامت از جمله : آب، غذا، هوا و محيط زيست دارد كه اين مورد خود.
Autonomous Programmable Nanorobotic Devices Using DNAzymes
Self-Assembly of Any Shape with
Complexities for the Design of Self-Assembly Systems
A Unidirectional DNA Walker Moving Autonomously Along a Track
Unit 3 Review (Calculator)
Sudheer Sahu John H. Reif Duke University
62 – Sequences and Series Day 1 Calculator Required
Calculate 9 x 81 = x 3 3 x 3 x 3 x 3 3 x 3 x 3 x 3 x 3 x 3 x =
DNA Solution of Hard Computational Problems
Multiple Sequence Alignment
Presentation transcript:

The Steps in a Walk Sherman, W.B. & Seeman, N.C. (2004), NanoLett. 4,

Animation of the Biped Walker Courtesy of Ann Marie Cunningham and Donna Vaughn of ScienCentral News

DNA-BASED COMPUTATION

The 1994 Adleman Hamiltonian Path Experiment

Seven Cities for a Hamiltonian Path Experiment

Routes for the Hamiltonian Path Experiment

The Hamiltonian Path

Assignment of Sequences

Strategy of the Hamiltonian Path Experiment

Algorithmic Assembly: A Cumulative XOR Calculation Chengde Mao Thom LaBean (Duke) John Reif (Duke)

Wang Tiles Grünbaum, B. & Shephard, G.C. Tilings & Patterns, W.H. Freeman & Co., New York, 1987 pp

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

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

Feedback: Privacy Policy Feedback
Do Not Sell My Personal Information
About project: SlidePlayer Terms of Service

© 2025 SlidePlayer.com. Inc. All rights reserved.