How many computers can fit into a drop of water? Udi Shapiro Ehud Shapiro.

Slides:



Advertisements
Similar presentations
The process of making proteins
Advertisements

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.
Central dogma DNA is made (transcribed) into RNA RNA is made (translated) into protein.
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.
A Mechanical Turing Machine: Blueprint for a Biomolecular Computer
1 Finite Automata. 2 Finite Automaton Input “Accept” or “Reject” String Finite Automaton Output.
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.
Costas Busch - RPI1 CSCI-2400 Models of Computation.
Finite Automata Costas Busch - RPI.
Grammars, Languages and Finite-state automata Languages are described by grammars We need an algorithm that takes as input grammar sentence And gives a.
1 Non-Deterministic Finite Automata. 2 Alphabet = Nondeterministic Finite Automaton (NFA)
Computers & Logic An Overview. Hardware Hardware is the equipment, or the devices, associated with a computer. For a computer to be useful, however, it.
In-Text Art, Ch. 9, p In-Text Art, Ch. 3, p. 37.
Objective 2.01 Test Review Name: Class Period:.
DNA Based Self-Assembly and Nano-Device: Theory and Practice Peng Yin Committee Prof. Reif (Advisor), Prof. Agarwal, Prof. Hartemink Prof. LaBean, Prof.
Introduction to the Theory of Computation
1 An Introduction to Formal Languages and Automata Provided by : Babak Salimi webAdd:
Protein Synthesis Occurs in 2 steps – Step 1: Transcription Taking DNA and transcribing it into RNA – Step 2: Translation Taking RNA and translating it.
Alan Turing WWII code-breaker mathematical proof of ‘Turing machines’ …in particular, “Universal Turing machine” laid foundations of computer science father.
CS 101 – Sept. 18 Adder circuit example (handout) How computers think –Concept of “state” –Turing machine model –Finite state machine model a.k.a. “Finite.
Chapter 10 Opener. Figure 10.1 Metabolic Diseases and Enzymes.
Branching in Biological Models of Computation Blair Andres-Beck, Vera Bereg, Stephanie Lee, Mike Lindmark, Wojciech Makowiecki Mike Lindmark, Wojciech.
The Tree of Life How do we select a gene sequence for comparison?
Models of Computation. Computation: Computation is a general term for any type of information processing information processing CPU memory.
Chs. 11 and 12 Clicker Quiz! Get your clickers ready! 8 questions.
English and computing. Да Нет Question 1 Is a computer an electronic machine which can accept data and give the results of the processing in a format.
DNA Structure. The Flow of Genetic Information from DNA to RNA to Protein –DNA functions as the inherited directions for a cell or organism. Copyright.
TRANSCRIPTION AND TRANSLATION: THE ROAD TO MAKING PROTEINS Part 1: Transcription (p 424) Investigative Question: What is RNA? What is Transcription?
A nanoscale programmable computing machine with input, output, software and hardware made of biomolecules Nature 414, (2001) Kobi Benenson supervisor:
Biomolecular Implementation of Computing Devices with Unbounded Memory Matteo CAVALIERE, Nataša JONOSKA, Nadrian C. SEEMAN. Department of Computer Science.
Turing Machine Model Are there computations that no “reasonable” computing machine can perform? –the machine should not store the answer to all possible.
How does DNA work? Gene: segment of DNA that codes for a protein Problem: DNA cannot leave the nucleus… but proteins are made in ribosomes. SO how do we.
Click to continue How do a few genes build a diversity of body parts? There’s more in the genetic toolkit than just genes! Click your forward cursor to.
Fall 2004COMP 3351 Finite Automata. Fall 2004COMP 3352 Finite Automaton Input String Output String Finite Automaton.
Finite Automata.
Formal Foundations-II [Theory of Automata]
An Introduction to Protein Synthesis
Introduction to the Theory of Computation
Turing Machines.
CSC312 Automata Theory Chapter # 5 by Cohen Finite Automata
AUTOMATA THEORY VI.
Protein Synthesis.
Notes – Protein Synthesis: Transcription
CSE322 Finite Automata Lecture #2.
محاضرة عامة التقنيات الحيوية (هندسة الجينات .. مبادئ وتطبيقات)
Controlling Gene Expression
Unit I Flash Cards Start.
How many computers can fit into a drop of water?
Timing and Development of Growth
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.
CSE322 Mealy and Moore Machine
Theory of computing, part 4
Jeopardy DNA to Protein
Polymerases Polymerases are the enzymes that synthesize copies of nucleic acids. DNA polymerase I (DNA pol I) Reverse transcriptase (Rtase) the enzyme.
Protein Synthesis Lecture 5
BioBricks.
CSC312 Automata Theory Chapter # 5 by Cohen Finite Automata
Tamar Ratner, Ron Piran, Natasha Jonoska, Ehud Keinan 
Nucleic Acid Molecules -DNA, RNA and ATP -Structure and Functions
Lecture One: Automata Theory Amjad Ali
Chapter # 5 by Cohen (Cont…)
Protein synthesis is the process by which cells. by
 Is a machine that is able to take information (input), do some work on (process), and to make new information (output) COMPUTER.
Internal components of a computer.
Non Deterministic Automata
Computer System.
Presentation transcript:

How many computers can fit into a drop of water? Udi Shapiro Ehud Shapiro

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

 micron in Pentium II Scaling electro and bio devices

E. Coli 1 micron  micron in Pentium II Scaling electro and bio devices

E. Coli

E. Coli internals (1Mbyte)

Ribosomes in operation Ribosomes translate RNA to Proteins RNA Polymerase transcribes DNA to RNA

A mechanical computer

A

BFront Back 1a 1b 2a 2b 3a 3b 4a 4b 5a 5b 5a 5b 4a 4b 3a 3b

Medicine in 2050: “Doctor in a Cell” Programmable Computer

S0 S1 a a b b A1: even number of b’s Automaton A1 accepting inputs with an even number of b ’s

Turing Machine and Finite Automaton

Example Computation

S0-abaaba (S0 S0) S0-baaba (S0 S1) S1-aaba (S1 S1) S1-aba (S1 S1) S1-ba (S1 S0) S0-a (S0 S0) S0 (final state) The input is accepted An example computation over abaaba

T1: S0 S0 T2: S0 S1 T3: S0 S0 T4: S0 S1 T5: S1 S0 T6: S1 S1 T7: S1 S0 T8: S1 S1 A list of all 8 possible transition rules

Automata programs used to test the molecular implementation

Molecular realization of Finite Automata Input: DNA S, a rest a’ Software: DNA S, a FokI Hardware: Class-II restriction enzyme FokI, DNA Ligase, ATP as fuel