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

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
Courtesy Costas Busch - RPI1 Non Deterministic Automata.
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.
Fall 2006Costas Busch - RPI1 Non-Deterministic Finite Automata.
DNA Computing DCS 860A-2008 Team 3 December 20, 2008 Marco Hernandez, Jeff Hutchinson, Nelson Kondulah, Kevin Lohrasbi, Frank Tsen.
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.
Costas Busch - LSU1 Non-Deterministic Finite Automata.
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.
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,
Introduction to CS Theory Lecture 3 – Regular Languages Piotr Faliszewski
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.
An autonomous molecular computer for logical control of gene expression Yaakov Benenson, Binyamin Gil, Uri Ben-Dor, Rivka Adar & Ehud Shapiro Weizmann.
Copyright © Curt Hill Finite State Machines The Simplest and Least Capable Automaton.
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.
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 9 Class Meeting Department of Computer Science San Jose State University Spring 2016 Instructor: Ron.
A nanoscale programmable computing machine with input, output, software and hardware made of biomolecules Nature 414, (2001) Kobi Benenson supervisor:
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.
Non Deterministic Automata
FORMAL LANGUAGES AND AUTOMATA THEORY
Pushdown Automata PDAs
Pushdown Automata PDAs
AUTOMATA THEORY VI.
OTHER MODELS OF TURING MACHINES
Introduction to the C Language
CSE322 Finite Automata Lecture #2.
Non-Determinism 12CS45 Finite Automata.
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.
Non-Deterministic Finite Automata
Non-Deterministic Finite Automata
CSE322 Definition and description of finite Automata
Non Deterministic Automata
Theory of computing, part 4
Pushdown automata a_introduction.htm.
Tamar Ratner, Ron Piran, Natasha Jonoska, Ehud Keinan 
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, 430-434 (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)

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

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 b S0, a  S0 S0, b  S1 S1, a  S1 S1, b  S0 a a S0 S1 b Two-states, two-symbols automaton

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

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

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

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

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

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

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

Rationale for the molecular design

Rationale for the molecular design CTGGCT GACCGA CGCAGC GCGTCG a b

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

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

Rationale for the molecular design Transitions S0, b CAGCCTGGCTCGCAGCTGTCGC GACCGAGCGTCGACAGCG a b t

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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 1012 automata run independently and in parallel on potentially distinct inputs in 120 ml at room temperature at combined rate of 109 transitions per second with accuracy greater than 99.8% per transition, consuming less than 10-10 Watt.