DNA Computing and Robotics Based on Deoxyribozymes.

Slides:



Advertisements
Similar presentations
ADDER, HALF ADDER & FULL ADDER
Advertisements

Digital Circuits. Review – Getting the truth table The first step in designing a digital circuit usually is to get the truth table. That is, for every.
1 SODA January 23, 2011 Temperature 1 Self-Assembly: Deterministic Assembly in 3D and Probabilistic Assembly in 2D Matthew CookUniversity of Zurich and.
Speical purpose Encoders/Comparators
1 KU College of Engineering Elec 204: Digital Systems Design Lecture 9 Programmable Configurations Read Only Memory (ROM) – –a fixed array of AND gates.
Digital Signal Processing with Biomolecular Reactions Hua Jiang, Aleksandra Kharam, Marc Riedel, and Keshab Parhi Electrical and Computer Engineering University.
DNA as a solution of computational problems Radosław Łazarz
CSE-221 Digital Logic Design (DLD)
Section 10.3 Logic Gates.
Combinational Logic1 DIGITAL LOGIC DESIGN by Dr. Fenghui Yao Tennessee State University Department of Computer Science Nashville, TN.
Part 2: DESIGN CIRCUIT. LOGIC CIRCUIT DESIGN x y z F F = x + y’z x y z F Truth Table Boolean Function.
Chapter 4 Register Transfer and Microoperations
CS 105 Digital Logic Design
XOR, XNOR, and Binary Adders
Shannon’s Expansion Muxes and Encoders. Tri-State Buffers  A tri-state buffer has one input x, one output f and one control line e Z means high impedance,
Combinational Circuits Chapter 3 S. Dandamudi To be used with S. Dandamudi, “Fundamentals of Computer Organization and Design,” Springer, 2003.
Adders and Multipliers Review. ARITHMETIC CIRCUITS Is a combinational circuit that performs arithmetic operations, e.g. –Addition –Subtraction –Multiplication.
1 Introduction to Abstract Mathematics Applications : Digital Logic Circuits 2.4 and Number Systems 2.5 Instructor: Hayk Melikya
Chapter 2: Fundamentals of Digital Electronics Dr Mohamed Menacer Taibah University
Digital Computer Concept and Practice Copyright ©2012 by Jaejin Lee Logic Circuits I.
Power Point Presentation Donald Bearden CS 147 September 13, 2001.
The Digital Logic Level
Digital Computer Concept and Practice Copyright ©2012 by Jaejin Lee Logic Circuits I.
Digital Logic Structures: Chapter 3 COMP 2610 Dr. James Money COMP
Lecture 9 Topics: –Combinational circuits Basic concepts Examples of typical combinational circuits –Half-adder –Full-adder –Ripple-Carry adder –Decoder.
EE5393, Circuits, Computation, and Biology Computing with Probabilities 1,1,0,0,0,0,1,0 1,1,0,1,0,1,1,1 1,1,0,0,1,0,1,0 a = 6/8 c = 3/8 b = 4/8.
4. Computer Maths and Logic 4.2 Boolean Logic Logic Circuits.
Logic Design CS 270: Mathematical Foundations of Computer Science Jeremy Johnson.
June 2005Computer Architecture, Background and MotivationSlide 1 Part I Background and Motivation.
ARITHMETIC MICRO OPERATIONS
1 Ethics of Computing MONT 113G, Spring 2012 Session 5 Binary Addition.
DNA Computing and Robotics:
Digital Logic Structures: Chapter 3 COMP 2610 Dr. James Money COMP
Chapter 3 Digital Logic Structures. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 3-2 Transistor: Building.
Logic Gates M. AL-Towaileb1. Introduction Boolean algebra is used to model the circuitry of electronic devices. Each input and each output of such a device.
COMBINATIONAL LOGIC.
1 Fundamentals of Computer Science Combinational Circuits.
Sayed Ahmad Salehi Marc D. Riedel Keshab K. Parhi University of Minnesota, USA Markov Chain Computations using Molecular Reactions 1.
CSI-2111 Structure of Computers Ipage Combinational Circuits  Objectives : To recognize the principal types of combinational circuits  Adders.
CS151 Introduction to Digital Design Chapter 5: Sequential Circuits 5-1 : Sequential Circuit Definition 5-2: Latches 1Created by: Ms.Amany AlSaleh.
How does a Computer Add ? Logic Gates within chips: AND Gate A B Output OR Gate A B Output A B A B
CSCE 211: Digital Logic Design Chin-Tser Huang University of South Carolina.
Playing to win at DNA computation Jeffrey J. Tabor, Andrew D. Ellington Nature Biotechnology 21(9), (2003) presented by Ki-Roo Shin.
Explain Half Adder and Full Adder with Truth Table.
Chapter 36 Combinational Logic Circuits. Objectives After completing this chapter, you will be able to: –Describe the functions of encoders, decoders,
Chapter 12. Chapter Summary Boolean Functions Representing Boolean Functions Logic Gates Minimization of Circuits (not currently included in overheads)
DNA Computing and Robotics Using DNAymes: Engineering (Science?), Fun, and Applications Milan N. Stojanovic NSF Center for Molecular Cybernetics Department.
Combinational Circuits
Autonomous Programmable Nanorobotic Devices Using DNAzymes
Combinational Circuits
Reference: Chapter 3 Moris Mano 4th Edition
Introduction to Tiling Assembly
Logic Gates L Al-zaid Math110.
COMBINATIONAL LOGIC.
CSCE 211: Digital Logic Design
A deoxyribozyme-based molecular automaton
Lecture 8 Logistics Last lecture Last last lecture Today
Discrete Mathematics CS 2610
Digital Logic.
DNA Computing and Robotics:
Part I Background and Motivation
CSCE 211: Digital Logic Design
Digital Logic.
DNA Hybridization Catalysts and Catalyst Circuits
Logic Gates Dr.Halimah Alshehri.
Combinational Circuits
Combinational Circuits
LOGIC Circuits.
A DNA Computing Readout Operation Structure-Specific Cleavage
Instruction execution and ALU
Presentation transcript:

DNA Computing and Robotics Based on Deoxyribozymes

DAO-E Sierpinski triangle experiments Paul Rothemund, Nick Papadakis, Erik Winfree, PLoS Biology 2: e424 (2004) 340nm

Part 1: How do we program mixtures of molecules in solution? Part 2: How do we program behavior of an individual molecule?

Introduction to deoxyribozymes: Complementary Single stranded DNA (or RNA) Joyce 1995, 1997

Introduction to deoxyribozymes II: Joyce 1995, 1997

…and we can combine them with stem loops: S

…into a two-state switch: Detector gate or sensor or YES gate or …

Complete set of switches: AND Gate: NOT Gate: ANDANDNOT: i3i3

Before we give examples of gates, a reminder: 1 is an increase in fluorescence, 0 no such increase!

A bit more about FRET: Cleavage

Stojanovic et al., ChemBioChem 2001 Stojanovic et al., J. Am. Chem. Soc Catalytic Molecular Beacons as Sensor Gates Joyce 1995, Breaker 1999, Tyagi, Kramer 1996

NOT Gates – Inverters: Stojanovic et al., J. Am. Chem. Soc. 2002

Dual Input Molecular Computation Elements: AND Gate FU t(min)

Triple Input Elements: ANDANDNOT (INHIBIT)

Triple Input Elements: ANDAND Harvey Lederman

Before we give examples of gates, a reminder: 1 is an increase in fluorescence, 0 no such increase!

Let’s add A (0 or 1) and X (0 or 1) and get O (0 or 1, or 2): A + X = O i1i1 i2i2 GRGRGRGRGR

Stojanovic & Stefanovic, J. Am. Chem. Soc Implement addition with gates:

Now, a twist: 1 is an increase in fluorescence, 0 no such increase! 1

d6 d4 d9 d5 d1 d2 d3 d8 d7 ABCDEFG 1  2   3  4   5   6  7  8 9  Segments required J. Macdonald, Columbia University Here is 7-segment display:

Test by constructing simple 2+2-bit adder :+= A1A1 A0A0 X1X1 X0X :+= Binary inputs :+= :+= Non general Display output Expected display Adder result “hard-wired” into decoder Designate 4 oligonucleotides as binary inputs J. Macdonald, Columbia University More arithmetical operations:

Determine logic gates required, and layout in wells (via Microsoft Excel) Very simple logic gate arrangement required: 4 YES gates 2 AND gates Fully constructible from reagents in freezer Tested with all input combinations…. J. Macdonald, Columbia University Adding 2+2 with visual display:

Perfect digital behavior Constructed & tested in a single day (A 1 A 0 + X 1 X 0  display) 01+01=01+10=10+01=10+10= No inputs (1+1=2) (1+2=3) (2+1=3) (2+2=4)Background Binary inputs: 7-segment Display Arithmetic B&W imager within ~1hr Color photograph ~5hrs Fluorescence reader ~20-30mins J. Macdonald, Columbia University; DNA 13, 2007

2x2 multiplier with visual display: Gate arrangement 19 gates required J. Macdonald, Columbia University (A 1 A 0 × X 1 X 0  display)

01 × 01 = (1×1=1) Arithmetic Binary inputs: 7-segment Display 01 × 10 =01 × 11 =10 × 01 =10 × 10 = 10 × 11 =11 × 01 =11 × 10 =11 × 11 =(00 × 00) (1×2=2)(1×3=3)(2×1=2)(2×2=4) (2×3=6)Arithmetic(3×1=3)(3×2=6)(3×3=9)no input control Binary inputs: 7-segment Display Color photography J. Macdonald, Columbia University 2x2 multiplier with visual display: (A 1 A 0 × X 1 X 0  display)

Silicomimetic automata project (MAYA): Macdonald et al. Nano Lett Stojanovic&Stefanovic. Nat.Biotech MAYA:MAYA-II:MAYA-III: Pei, Matamoros, et al. in testing Human designed Goal: Demonstrate power of molecular computing! Computer designedHuman designed Goal: What does it take to coordinate large number of gates? Goal: Field programmable arrays of gates! -Teaching “by example” -Selecting strategy (“carving”)

Implementation of tic-tac-toe playing algorithm with deoxiribozymes: Molecular Array of YES and ANDANDNOT Gates (MAYA) Stojanovic, Stefanovic, Nat. Biotech. 2003

MAYA vs. Milan: losing game Mg 2+ From Sci. Am. 2008

Is it possible to have serial circuits? (Upstream enzyme)(downstream enzyme)

Intergate Communication : Ligase-Cleavase Stanka Semova, Dmitry Kolpashchikov

Ligase-cleaves XOR circuit: JACS 2005 O IAIA IBIB XOR

What about cleavase-cleavase? a. Substrate as inhibitor c. Substrate as activator b. product as activator d. product as inhibitor Cf. Uri Alon, Nat. Rev. Genetics 2007, 450 “Network Motifs: Theory and Experimental Approaches”

Ben-Tov, Tamburi +inhibitor Connection type I: Substrate as inhibitor

Connection type II: Product as activator 50nM d-8-17, 500nM d-sub, 500nM stem- loop, 50nM up-8-17, 500nM input +MB cont +U +i,p MB Renjun Pei

Connection type III: Substrate as activator 100nM E6, 500nM d-sub, 500nM activator, 50nM act +U cont Renjun Pei, Aihua Shen

Connection type IV: Product as inhibitor 100nM E6, 500nM d-sub, 250nM stem-loop, 50nM 8-17 P +MB +U Renjun Pei, Aihua Shen

AND cascade: 100nM E6, 500nM d-sub, 350nM inh-1, 350nM inh-2, 50nM , 50nM p E-1 2 Es 2 inhs E-2

Now we can do signal threshold: 100nM D, 500nM d-sub, 20nM U, 200nM inh at time 180 minutes. one eq.

In Circuits by Winfree’s group: Inputs Input Translation Computational subcircuit Signal restoration