59
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)

Kobi Benenson supervisor: Ehud Shapiro, Dept of Computer Science & Applied Math Acknowledgements:

  • Upload
    gunda

  • View
    54

  • Download
    2

Embed Size (px)

DESCRIPTION

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), - PowerPoint PPT Presentation

Citation preview

Page 1: Kobi Benenson supervisor: Ehud Shapiro, Dept of Computer Science & Applied Math  Acknowledgements:

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)

Page 2: Kobi Benenson supervisor: Ehud Shapiro, Dept of Computer Science & Applied Math  Acknowledgements:

“Medicine in 2050: Doctor in a Cell”

Programmable Computer

Molecular Input

Molecular Output

Page 3: Kobi Benenson supervisor: Ehud Shapiro, Dept of Computer Science & Applied Math  Acknowledgements:

Research goal:

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

Page 4: Kobi Benenson supervisor: Ehud Shapiro, Dept of Computer Science & Applied Math  Acknowledgements:

Finite automaton: an example

An even number of b’s

S0, a S0S0, b S1S1, a S1S1, b S0

S1S0

b

a

b

a

Two-states, two-symbols automaton

Page 5: Kobi Benenson supervisor: Ehud Shapiro, Dept of Computer Science & Applied Math  Acknowledgements:

Automaton 1

b a b

S0, a S0S0, b S1S1, a S1S1, b S0

An even number of b’s

S0

Page 6: Kobi Benenson supervisor: Ehud Shapiro, Dept of Computer Science & Applied Math  Acknowledgements:

Automaton 1

b a b

S0, a S0S0, b S1S1, a S1S1, b S0

An even number of b’s

S0

S0, b S1

Page 7: Kobi Benenson supervisor: Ehud Shapiro, Dept of Computer Science & Applied Math  Acknowledgements:

Automaton 1

a b

S0, a S0S0, b S1S1, a S1S1, b S0

An even number of b’s

S1

Page 8: Kobi Benenson supervisor: Ehud Shapiro, Dept of Computer Science & Applied Math  Acknowledgements:

Automaton 1

a b

S0, a S0S0, b S1S1, a S1S1, b S0

An even number of b’s

S1

S1, a S1

Page 9: Kobi Benenson supervisor: Ehud Shapiro, Dept of Computer Science & Applied Math  Acknowledgements:

Automaton 1

b

S0, a S0S0, b S1S1, a S1S1, b S0

An even number of b’s

S1

Page 10: Kobi Benenson supervisor: Ehud Shapiro, Dept of Computer Science & Applied Math  Acknowledgements:

Automaton 1

b

S0, a S0S0, b S1S1, a S1S1, b S0

An even number of b’s

S1

S1, b S0

Page 11: Kobi Benenson supervisor: Ehud Shapiro, Dept of Computer Science & Applied Math  Acknowledgements:

Automaton 1

S0, a S0S0, b S1S1, a S1S1, b S0

An even number of b’s

S0

The output

Page 12: Kobi Benenson supervisor: Ehud Shapiro, Dept of Computer Science & Applied Math  Acknowledgements:

Rationale for the molecular design

Page 13: Kobi Benenson supervisor: Ehud Shapiro, Dept of Computer Science & Applied Math  Acknowledgements:

bCGCAGCGCGTCGaCTGGCT

GACCGA

Rationale for the molecular design

Page 14: Kobi Benenson supervisor: Ehud Shapiro, Dept of Computer Science & Applied Math  Acknowledgements:

bCGCAGCGCGTCGaCTGGCT

GACCGA

CAGC

GGCT

S0, a

Rationale for the molecular design

S0, b

Page 15: Kobi Benenson supervisor: Ehud Shapiro, Dept of Computer Science & Applied Math  Acknowledgements:

bCGCAGCGCGTCGaCTGGCT

GACCGA

CAGC

GGCT

S0, a S0, b

CGCAGC CG

CTGGCT GA

S1, a S1, b

Rationale for the molecular design

Page 16: Kobi Benenson supervisor: Ehud Shapiro, Dept of Computer Science & Applied Math  Acknowledgements:

TransitionsTransitions

a b t

CAGCCTGGCTCGCAGCTGTCGC GACCGAGCGTCGACAGCG

S0, b

Rationale for the molecular design

Page 17: Kobi Benenson supervisor: Ehud Shapiro, Dept of Computer Science & Applied Math  Acknowledgements:

S0, b S1

TransitionsTransitions

a b t

CAGCCTGGCTCGCAGCTGTCGC GACCGAGCGTCGACAGCG

S0, b

Rationale for the molecular design

Page 18: Kobi Benenson supervisor: Ehud Shapiro, Dept of Computer Science & Applied Math  Acknowledgements:

TransitionsTransitions

b t

CTGGCTCGCAGCTGTCGC GAGCGTCGACAGCG

S1, a

Rationale for the molecular design

S0, b S1

Page 19: Kobi Benenson supervisor: Ehud Shapiro, Dept of Computer Science & Applied Math  Acknowledgements:

TransitionsTransitions

b t

CTGGCTCGCAGCTGTCGC GAGCGTCGACAGCG

S1, a

Rationale for the molecular design

S1, a S1

Page 20: Kobi Benenson supervisor: Ehud Shapiro, Dept of Computer Science & Applied Math  Acknowledgements:

S1, a S1

TransitionsTransitions

t

CGCAGCTGTCGC CGACAGCG

S1, b

Rationale for the molecular design

Page 21: Kobi Benenson supervisor: Ehud Shapiro, Dept of Computer Science & Applied Math  Acknowledgements:

S1, b S0

TransitionsTransitions

t

CGCAGCTGTCGC CGACAGCG

S1, b

Rationale for the molecular design

Page 22: Kobi Benenson supervisor: Ehud Shapiro, Dept of Computer Science & Applied Math  Acknowledgements:

S1, b S0

TransitionsTransitions

TCGC

S0, t

Rationale for the molecular design

Page 23: Kobi Benenson supervisor: Ehud Shapiro, Dept of Computer Science & Applied Math  Acknowledgements:

Output: S0

TransitionsTransitions

TCGC

S0, t

Rationale for the molecular design

Page 24: Kobi Benenson supervisor: Ehud Shapiro, Dept of Computer Science & Applied Math  Acknowledgements:

Transition procedure: a conceptTransition procedure: a concept

a b t

CAGCCTGGCTCGCAGCTGTCGC GACCGAGCGTCGACAGCG

S0, b

Rationale for the molecular design

Page 25: Kobi Benenson supervisor: Ehud Shapiro, Dept of Computer Science & Applied Math  Acknowledgements:

Transition procedure: a conceptTransition procedure: a concept

a b t

CAGCCTGGCTCGCAGCTGTCGC GACCGAGCGTCGACAGCG

S0, b

GTCG

4 nt

8 nt

S0, b -> S1

Rationale for the molecular design

Page 26: Kobi Benenson supervisor: Ehud Shapiro, Dept of Computer Science & Applied Math  Acknowledgements:

Transition procedure: a conceptTransition procedure: a concept

b t

CAGCCTGGCTCGCAGCTGTCGC GACCGAGCGTCGACAGCGGTCG

4 nt

8 nt

S0, b -> S1

Rationale for the molecular design

Page 27: Kobi Benenson supervisor: Ehud Shapiro, Dept of Computer Science & Applied Math  Acknowledgements:

Transition procedure: a conceptTransition procedure: a concept

b t

CTGGCTCGCAGCTGTCGC GAGCGTCGACAGCG

S0, b -> S1

S1, a

Rationale for the molecular design

Page 28: Kobi Benenson supervisor: Ehud Shapiro, Dept of Computer Science & Applied Math  Acknowledgements:

Transition procedure: a conceptTransition procedure: a concept

b t

CTGGCTCGCAGCTGTCGC GAGCGTCGACAGCG

S1, a -> S1

S1, a

Rationale for the molecular design

Page 29: Kobi Benenson supervisor: Ehud Shapiro, Dept of Computer Science & Applied Math  Acknowledgements:

Transition procedure: a conceptTransition procedure: a concept

b t

CTGGCTCGCAGCTGTCGC GAGCGTCGACAGCG

S1, a -> S1

S1, a

GACC

6 nt

10 nt

Rationale for the molecular design

Page 30: Kobi Benenson supervisor: Ehud Shapiro, Dept of Computer Science & Applied Math  Acknowledgements:

Transition procedure: a conceptTransition procedure: a concept

t

CTGGCTCGCAGCTGTCGC GAGCGTCGACAGCG

S1, a -> S1

GACC

6 nt

10 nt

Rationale for the molecular design

Page 31: Kobi Benenson supervisor: Ehud Shapiro, Dept of Computer Science & Applied Math  Acknowledgements:

Transition procedure: a conceptTransition procedure: a concept

t

CGCAGCTGTCGC CGACAGCG

S1, a -> S1

S1, b

Rationale for the molecular design

Page 32: Kobi Benenson supervisor: Ehud Shapiro, Dept of Computer Science & Applied Math  Acknowledgements:

Transition procedure: a conceptTransition procedure: a concept

t

CGCAGCTGTCGC CGACAGCG

S1, b -> S0

S1, b

GCGT

8 nt

12 nt

Rationale for the molecular design

Page 33: Kobi Benenson supervisor: Ehud Shapiro, Dept of Computer Science & Applied Math  Acknowledgements:

Transition procedure: a conceptTransition procedure: a concept

CGCAGCTGTCGC CGACAGCG

S1, b -> S0

GCGT

8 nt

12 nt

Rationale for the molecular design

Page 34: Kobi Benenson supervisor: Ehud Shapiro, Dept of Computer Science & Applied Math  Acknowledgements:

Transition procedure: a conceptTransition procedure: a concept

TCGC

Output: S0

S0, t

Rationale for the molecular design

Page 35: Kobi Benenson supervisor: Ehud Shapiro, Dept of Computer Science & Applied Math  Acknowledgements:

In situIn situ detection detection

TCGC

Output: S0

S0, t

AGCG

Detection moleculefor S0 output

Rationale for the molecular design

Page 36: Kobi Benenson supervisor: Ehud Shapiro, Dept of Computer Science & Applied Math  Acknowledgements:

In situIn situ detection detection

TCGC

Output: S0

AGCGReporter moleculefor S0 output

Rationale for the molecular design

Page 37: Kobi Benenson supervisor: Ehud Shapiro, Dept of Computer Science & Applied Math  Acknowledgements:

Inside the transition molecule

S0,b -> S1

GTCG

4 nt

8 nt

Page 38: Kobi Benenson supervisor: Ehud Shapiro, Dept of Computer Science & Applied Math  Acknowledgements:

Inside the transition molecule

S0,b -> S1

GTCG

4 nt

8 nt

GGATGACGACCCTACTGCTG

FokI

Page 39: Kobi Benenson supervisor: Ehud Shapiro, Dept of Computer Science & Applied Math  Acknowledgements:

Inside the transition molecule

S0,b -> S1

GTCG

4 nt

8 nt

GGATGACGACCCTACTGCTG

9 nt

13 nt

FokI

Page 40: Kobi Benenson supervisor: Ehud Shapiro, Dept of Computer Science & Applied Math  Acknowledgements:

Inside the transition molecule

S0,b -> S1

GTCGGGATGACGACCCTACTGCTG

9 nt

13 nt

FokI

Page 41: Kobi Benenson supervisor: Ehud Shapiro, Dept of Computer Science & Applied Math  Acknowledgements:
Page 42: Kobi Benenson supervisor: Ehud Shapiro, Dept of Computer Science & Applied Math  Acknowledgements:

Inside the transition molecule

S1,a -> S1

GACC

6 nt

10 nt

Page 43: Kobi Benenson supervisor: Ehud Shapiro, Dept of Computer Science & Applied Math  Acknowledgements:

Inside the transition molecule

S1,a -> S1

GACC

6 nt

10 nt

GGATGACG CCTACTGC

9 nt

13 nt

FokI

Page 44: Kobi Benenson supervisor: Ehud Shapiro, Dept of Computer Science & Applied Math  Acknowledgements:

Inside the transition molecule

S1,a -> S1

GACC GGATGACG CCTACTGC

9 nt

13 nt

FokI

Page 45: Kobi Benenson supervisor: Ehud Shapiro, Dept of Computer Science & Applied Math  Acknowledgements:

Inside the transition molecule

S1,b -> S0

GCGT

8 nt

12 nt

Page 46: Kobi Benenson supervisor: Ehud Shapiro, Dept of Computer Science & Applied Math  Acknowledgements:

Inside the transition molecule

S1,b -> S0

GCGT

8 nt

12 nt

GGATGG CCTACC

9 nt

13 nt

FokI

Page 47: Kobi Benenson supervisor: Ehud Shapiro, Dept of Computer Science & Applied Math  Acknowledgements:

Inside the transition molecule

S1,b -> S0

GCGT GGATGG CCTACC

9 nt

13 nt

FokI

Page 48: Kobi Benenson supervisor: Ehud Shapiro, Dept of Computer Science & Applied Math  Acknowledgements:

Inside the transition molecule

GACC GGATGACG CCTACTGC

GTCGGGATGACGACCCTACTGCTG

GCGT GGATGG CCTACC

S0 -> S1

S0 -> S0

S1 -> S1

S1 -> S0

Page 49: Kobi Benenson supervisor: Ehud Shapiro, Dept of Computer Science & Applied Math  Acknowledgements:

Transition rules: complete list

Page 50: Kobi Benenson supervisor: Ehud Shapiro, Dept of Computer Science & Applied Math  Acknowledgements:

S0 S1

a a

b

A2: at most one b

b

A6: no a after b

S0 S1

a b

S0 S1

a

b

a

A4: no two consecutive b’s

S0

a

A5: only a’s

S0 S1

a a

b b

A3: at least one b

S0 S1

b a

a b

A7: starts with a and ends with b

Automata programs used to test the molecular implementation

Page 51: Kobi Benenson supervisor: Ehud Shapiro, Dept of Computer Science & Applied Math  Acknowledgements:

Transition molecules: complete list

Page 52: Kobi Benenson supervisor: Ehud Shapiro, Dept of Computer Science & Applied Math  Acknowledgements:

Input and detection molecules

Page 53: Kobi Benenson supervisor: Ehud Shapiro, Dept of Computer Science & Applied Math  Acknowledgements:

Experimental testing of automaton programs A1 – A6

Page 54: Kobi Benenson supervisor: Ehud Shapiro, Dept of Computer Science & Applied Math  Acknowledgements:

Computations over 6-symbol long input molecules

Page 55: Kobi Benenson supervisor: Ehud Shapiro, Dept of Computer Science & Applied Math  Acknowledgements:

Parallel computation

Page 56: Kobi Benenson supervisor: Ehud Shapiro, Dept of Computer Science & Applied Math  Acknowledgements:

Identification of the essential components

Page 57: Kobi Benenson supervisor: Ehud Shapiro, Dept of Computer Science & Applied Math  Acknowledgements:

Close inspection of the reaction intermediates

Page 58: Kobi Benenson supervisor: Ehud Shapiro, Dept of Computer Science & Applied Math  Acknowledgements:

An estimation of system fidelity

Page 59: Kobi Benenson supervisor: Ehud Shapiro, Dept of Computer Science & Applied Math  Acknowledgements:

Summary

• 1012 automata run independently and in parallel

• on potentially distinct inputs

• in 120 l

• 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.