A nanoscale programmable computing machine with input, output, software and hardware made of biomolecules Nature 414, 430-434 (2001) Kobi Benenson supervisor:

Slides:



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

Design of a biomolecular Device that executes process Algebra Urmi Majumder and John Reif Department of Computer Science Duke University DNA15, JUNE 10,
Existing “autonomous” system Sakamoto & Hagiya State transitions by molecules A transition table:{S  S’} Starting from the initial state, calculate as.
A Mechanical Turing Machine: Blueprint for a Biomolecular Computer Udi Shapiro Ehud Shapiro.
Molecular Computing Machine Uses its Input as Fuel Kobi Benenson Joint work with Rivka Adar, Tamar Paz-Elizur, Zvi Livneh and Ehud Shapiro Department of.
DNA Computing Computation with the Code of Life Michael Ang Interactive Telecommunications Program New York University February 16,
1 DNA Computing: Concept and Design Ruoya Wang April 21, 2008 MATH 8803 Final presentation.
DNA as a solution of computational problems Radosław Łazarz
Finite Automata Finite-state machine with no output. FA consists of States, Transitions between states FA is a 5-tuple Example! A string x is recognized.
1 The scanning process Goal: automate the process Idea: –Start with an RE –Build a DFA How? –We can build a non-deterministic finite automaton (Thompson's.
Modeling a Molecular Computing Device Using  -Calculus Semester Project Ya ’ ara Goldschmidt Department of Applied Math – Bioinformatics June 2001.
Abstract: This research concentrates on constructing a two-symbol-two- state finite automaton made entirely of molecular components. The output contains.
1 Regular expression matching with input compression : a hardware design for use within network intrusion detection systems Department of Computer Science.
Chapter 16 Programming and Languages: Telling the Computer What to Do.
A sample processing of an input molecule. S0 S1 a a b b A1: even number of b’s Automaton A1 accepting inputs with an even number of b ’s.
S, a rest a’ Basic cycle of automaton Iterative processing of input until the end is reached S, a S ’ Detect the result State-symbol tag S’, a’ rest.
DNA Computing DCS 860A-2008 Team 3 December 20, 2008 Marco Hernandez, Jeff Hutchinson, Nelson Kondulah, Kevin Lohrasbi, Frank Tsen.
The Effect of Coding on Computation Adina Lederhendler Topics in Biological Physics 23/12/08 Shannon: A universal Turing machine with two internal states.
Mahapatra-A&M-Sprong'021 Co-design Finite State Machines Many slides of this lecture are borrowed from Margarida Jacome.
Costas Busch - RPI1 CSCI-2400 Models of Computation.
How many computers can fit into a drop of water? Udi Shapiro Ehud Shapiro.
1 Non-Deterministic Finite Automata. 2 Alphabet = Nondeterministic Finite Automaton (NFA)
AUTOMATA THEORY VIII.
DNA Based Self-Assembly and Nano-Device: Theory and Practice Peng Yin Committee Prof. Reif (Advisor), Prof. Agarwal, Prof. Hartemink Prof. LaBean, Prof.
Chapter I: Introduction to Computer Science. Computer: is a machine that accepts input data, processes the data and creates output data. This is a specific-purpose.
©Brooks/Cole, 2003 Foundations of Computer Science from Data Manipulation to Theory of Computation Behrouz A. Forouzan, Brooks/Cole — Thomson Learning,
Procedures for managing workflow components Workflow components: A workflow can usually be described using formal or informal flow diagramming techniques,
Stochastic Computing with Biomolecular Automata Advanced Artificial Intelligence Cho, Sung Bum.
Cellular Automata based Edge Detection. Cellular Automata Definition A discrete mathematical system characterized by local interaction and an inherently.
Mahapatra-A&M-Fall'001 Co-design Finite State Machines Many slides of this lecture are borrowed from Margarida Jacome.
An autonomous molecular computer for logical control of gene expression Yaakov Benenson, Binyamin Gil, Uri Ben-Dor, Rivka Adar & Ehud Shapiro Weizmann.
Stochastic Computing with Biomolecular Automata R. Adar, Y. Benenson, G. Linshiz, A. Rosner, N. Tishby, and E. Shapiro PNAS, vol. 101, no. 27, pp ,
Branching in Biological Models of Computation Blair Andres-Beck, Vera Bereg, Stephanie Lee, Mike Lindmark, Wojciech Makowiecki Mike Lindmark, Wojciech.
Models of Computation. Computation: Computation is a general term for any type of information processing information processing CPU memory.
Finite State Machines CS147 : Presentation by Mabel Thong (9/25/07)
Three Basic Concepts Languages Grammars Automata.
Molecular State Machines Masami Hagiya. Finite State Machines Are the simplest formal computing device Have a finite number of states Change their state.
Information Systems Concepts Basic Computer Concepts Information Systems  Information System  a particular discipline or branch of learning that is concerned.
CS 154 Formal Languages and Computability February 4 Class Meeting Department of Computer Science San Jose State University Spring 2016 Instructor: Ron.
CS 154 Formal Languages and Computability February 9 Class Meeting Department of Computer Science San Jose State University Spring 2016 Instructor: Ron.
Lecture 5: K-Map minimization in larger input dimensions and K-map minimization using max terms CSE 140: Components and Design Techniques for Digital Systems.
Theory of Computation Automata Theory Dr. Ayman Srour.
Objective of the course Understanding the fundamentals of the compilation technique Assist you in writing you own compiler (or any part of compiler)
Chapter I: Introduction to Computer Science. Computer: is a machine that accepts input data, processes the data and creates output data. This is a specific-purpose.
Formal Languages and Automata FORMAL LANGUAGES FINITE STATE AUTOMATA.
Department of Software & Media Technology
Finite Automata.
Language Recognition MSU CSE 260.
Lexical analysis Finite Automata
FORMAL LANGUAGES AND AUTOMATA THEORY
AUTOMATA THEORY VI.
OTHER MODELS OF TURING MACHINES
Chapter 2 FINITE AUTOMATA.
Introduction to the C Language
CSE322 Finite Automata Lecture #2.
Regular Expression Acceleration at Multiple Tens of Gb/s
How many computers can fit into a drop of water?
CSCI-2400 Models of Computation Costas Busch - RPI.
A nanoscale programmable computing machine with input, output, software and hardware made of biomolecules Nature 414, (2001) Kobi Benenson.
Non Deterministic Automata
Theory of computing, part 4
Pushdown automata a_introduction.htm.
Tamar Ratner, Ron Piran, Natasha Jonoska, Ehud Keinan 
Unit 1.0 – Explore the concepts of computers and computing
Lecture One: Automata Theory Amjad Ali
 Is a machine that is able to take information (input), do some work on (process), and to make new information (output) COMPUTER.
Materials Reminders.
Internal components of a computer.
Non Deterministic Automata
Presentation transcript:

A nanoscale programmable computing machine with input, output, software and hardware made of biomolecules Nature 414, (2001) Kobi Benenson supervisor: Ehud Shapiro, Dept of Computer Science & Applied Math Acknowledgements: Ehud Keinan (Technion), Zvi Livneh (WIS), Tami Paz-Elizur (WIS), Rivka Adar (WIS), Aviv Regev (WIS), Irith Sagi (WIS), Ada Yonath (WIS)

“Medicine in 2050: Doctor in a Cell” Programmable Computer Molecular Input Molecular Output

Research goal: Design a simplest non-trivial molecular computing machine (two-state two-symbol finite automaton) that works on engineered inputs

Finite automaton: an example An even number of b ’ s S0, a  S0 S0, b  S1 S1, a  S1 S1, b  S0 S1 S0 b a b a Two-states, two-symbols automaton

Automaton 1 bab S0, a  S0 S0, b  S1 S1, a  S1 S1, b  S0 An even number of b ’ s S0

Automaton 1 bab S0, a  S0 S0, b  S1 S1, a  S1 S1, b  S0 An even number of b ’ s S0 S0, b  S1

Automaton 1 ab S0, a  S0 S0, b  S1 S1, a  S1 S1, b  S0 An even number of b ’ s S1

Automaton 1 ab S0, a  S0 S0, b  S1 S1, a  S1 S1, b  S0 An even number of b ’ s S1 S1, a  S1

Automaton 1 b S0, a  S0 S0, b  S1 S1, a  S1 S1, b  S0 An even number of b ’ s S1

Automaton 1 b S0, a  S0 S0, b  S1 S1, a  S1 S1, b  S0 An even number of b ’ s S1 S1, b  S0

Automaton 1 S0, a  S0 S0, b  S1 S1, a  S1 S1, b  S0 An even number of b ’ s S0 The output

Rationale for the molecular design

b CGCAGC GCGTCG a CTGGCT GACCGA Rationale for the molecular design

b CGCAGC GCGTCG a CTGGCT GACCGA CAGC GGCT S0, a Rationale for the molecular design S0, b

b CGCAGC GCGTCG a CTGGCT GACCGA CAGC GGCT S0, aS0, b CGCAGC CG CTGGCT GA S1, aS1, b Rationale for the molecular design

Transitions abt CAGCCTGGCTCGCAGCTGTCGC GACCGAGCGTCGACAGCG S0, b Rationale for the molecular design

S0, b  S1 Transitions abt CAGCCTGGCTCGCAGCTGTCGC GACCGAGCGTCGACAGCG S0, b Rationale for the molecular design

Transitions bt CTGGCTCGCAGCTGTCGC GAGCGTCGACAGCG S1, a Rationale for the molecular design S0, b  S1

Transitions bt CTGGCTCGCAGCTGTCGC GAGCGTCGACAGCG S1, a Rationale for the molecular design S1, a  S1

Transitions t CGCAGCTGTCGC CGACAGCG S1, b Rationale for the molecular design

S1, b  S0 Transitions t CGCAGCTGTCGC CGACAGCG S1, b Rationale for the molecular design

S1, b  S0 Transitions TCGC S0, t Rationale for the molecular design

Output: S0 Transitions TCGC S0, t Rationale for the molecular design

Transition procedure: a concept abt CAGCCTGGCTCGCAGCTGTCGC GACCGAGCGTCGACAGCG S0, b Rationale for the molecular design

Transition procedure: a concept abt CAGCCTGGCTCGCAGCTGTCGC GACCGAGCGTCGACAGCG S0, b GTCG 4 nt 8 nt S0, b -> S1 Rationale for the molecular design

Transition procedure: a concept bt CAGCCTGGCTCGCAGCTGTCGC GACCGAGCGTCGACAGCG GTCG 4 nt 8 nt S0, b -> S1 Rationale for the molecular design

Transition procedure: a concept bt CTGGCTCGCAGCTGTCGC GAGCGTCGACAGCG S0, b -> S1 S1, a Rationale for the molecular design

Transition procedure: a concept bt CTGGCTCGCAGCTGTCGC GAGCGTCGACAGCG S1, a -> S1 S1, a Rationale for the molecular design

Transition procedure: a concept bt CTGGCTCGCAGCTGTCGC GAGCGTCGACAGCG S1, a -> S1 S1, a GACC 6 nt 10 nt Rationale for the molecular design

Transition procedure: a concept t CTGGCTCGCAGCTGTCGC GAGCGTCGACAGCG S1, a -> S1 GACC 6 nt 10 nt Rationale for the molecular design

Transition procedure: a concept t CGCAGCTGTCGC CGACAGCG S1, a -> S1 S1, b Rationale for the molecular design

Transition procedure: a concept t CGCAGCTGTCGC CGACAGCG S1, b -> S0 S1, b GCGT 8 nt 12 nt Rationale for the molecular design

Transition procedure: a concept CGCAGCTGTCGC CGACAGCG S1, b -> S0 GCGT 8 nt 12 nt Rationale for the molecular design

Transition procedure: a concept TCGC Output: S0 S0, t Rationale for the molecular design

In situ detection TCGC Output: S0 S0, t AGCG Detection molecule for S0 output Rationale for the molecular design

In situ detection TCGC Output: S0 AGCG Reporter molecule for S0 output Rationale for the molecular design

Inside the transition molecule S0,b -> S1 GTCG 4 nt 8 nt

Inside the transition molecule S0,b -> S1 GTCG 4 nt 8 nt GGATGACGAC CCTACTGCTG FokI

Inside the transition molecule S0,b -> S1 GTCG 4 nt 8 nt GGATGACGAC CCTACTGCTG 9 nt 13 nt FokI

Inside the transition molecule S0,b -> S1 GTCG GGATGACGAC CCTACTGCTG 9 nt 13 nt FokI

Inside the transition molecule S1,a -> S1 GACC 6 nt 10 nt

Inside the transition molecule S1,a -> S1 GACC 6 nt 10 nt GGATGACG CCTACTGC 9 nt 13 nt FokI

Inside the transition molecule S1,a -> S1 GACC GGATGACG CCTACTGC 9 nt 13 nt FokI

Inside the transition molecule S1,b -> S0 GCGT 8 nt 12 nt

Inside the transition molecule S1,b -> S0 GCGT 8 nt 12 nt GGATGG CCTACC 9 nt 13 nt FokI

Inside the transition molecule S1,b -> S0 GCGT GGATGG CCTACC 9 nt 13 nt FokI

Inside the transition molecule GACC GGATGACG CCTACTGC GTCG GGATGACGAC CCTACTGCTG GCGT GGATGG CCTACC S0 -> S1 S0 -> S0 S1 -> S1 S1 -> S0

Transition rules: complete list

Automata programs used to test the molecular implementation

Transition molecules: complete list

Input and detection molecules

Experimental testing of automaton programs A1 – A6

Computations over 6-symbol long input molecules

Parallel computation

Identification of the essential components

Close inspection of the reaction intermediates

An estimation of system fidelity

Summary automata run independently and in parallel on potentially distinct inputs in 120  l at room temperature at combined rate of 10 9 transitions per second with accuracy greater than 99.8% per transition, consuming less than Watt.