Professional Documents
Culture Documents
DNA Computing
DNA Computing
By Thierry Metais
Email: metais@enst.fr
Introduction to DNA:
The life’s molecule:
Introduction:
What is DNA computing ?
Around 1950 first idea (precursor Feynman)
First important experiment 1994: Leonard Adleman
5 2
3
4
S0 S2 S5 S3 S1 S4 S6
E0-2 E2-5 E5-3 E3-1 E1-4 E4-6
New generation of computers?
In the second part of [1], it is proven through
language theory that DNA computing
“guarantees universal computations”.
Many architectures have been invented for
DNA computations.
The Adleman experiment is not the single
application case of DNA computing…
Stickers model:
Memory complex = Strand of DNA (single or
semi-double).
Stickers are segments of DNA, that are
composed of a certain number of DNA bases.
To use correctly the stickers model, each
sticker must be able to anneal only at a
specific place in the memory complex.
To visualize:
0 0 0 1 0 1 0 0 1 0
Memory complex:
Semi-double
Soup of stickers:
=
A G C A T G A T
Zoom
About a stickers machine?