11-05-2011, 09:48 AM
Presented by:
DIBYAKANTA MOHARANA
DNA_Computing.ppt (Size: 720.5 KB / Downloads: 120)
INTRODUCTION
Double-stranded molecule twisted into a helix
Each strand, comprised of a
sugar-phosphate backbone and
attached bases, is connected to
a complementary strand by non
-covalent hydrogen bonding
between paired bases
Bases are:
adenine (A)
thymine (T)
guanine (G).
cytosine ©
A and T are connected by two hydrogen bonds. G and C
are connected by three hydrogen bonds
DNA as computing machine
A DNA-based finite automaton computes via repeated
cycles of self assembly and processing
DNA molecules serve as input, output, and software, and
the hardware consists of DNA restriction and ligation
Enzymes Using ATP as fuel
The reversible self-assembly is driven by hybridization
energy between input/software complementary sticky ends,
followed by an irreversible processing step i.e. an
irreversible software-directed cleavage (hydrolysis of the
Input DNA backbone)of the input molecule,which drives the computation forward by increasing entropy and releasing
heat and hence does not require ATP or heating.
The cleavage uses the restriction enzyme FokI, which serves as the hardware, to operate on a non covalent software/input hybrid.
This automaton use a fixed amount of software and hardware molecules to process any input molecule of any length without external energy supply.
This automaton demonstrate automata per µl
performing transitions per second per µl
dissipating about W/µl as heat .
CONCEPTS OF DNA COMPUTING
• DNA computing is also known as molecular computing. A DNA computer is basically a collection of specially selected DNA strands whose combinations will result in the solution to some problem, depending on the problem at hand.
• Think of DNA as software and enzymes as hardware. Put them together in a test tube. The incredible thing is that once the DNA sequence has been created, simply just add water to initiate the computation.
• DNA computer can be called as a bio-chemical reaction system where they choose specific reactions and use a program to control the order of reactions in which to trigger them.
• The promise of DNA computing is massive parallelism: with the given setup and enough DNA, one can potentially solve huge problems by parallel search. This can be much faster than a conventional computer.
DNA computers using dynamic programming could solve substantially larger instances because their large memory capacity then either conventional computers
DIBYAKANTA MOHARANA
DNA_Computing.ppt (Size: 720.5 KB / Downloads: 120)
INTRODUCTION
Double-stranded molecule twisted into a helix
Each strand, comprised of a
sugar-phosphate backbone and
attached bases, is connected to
a complementary strand by non
-covalent hydrogen bonding
between paired bases
Bases are:
adenine (A)
thymine (T)
guanine (G).
cytosine ©
A and T are connected by two hydrogen bonds. G and C
are connected by three hydrogen bonds
DNA as computing machine
A DNA-based finite automaton computes via repeated
cycles of self assembly and processing
DNA molecules serve as input, output, and software, and
the hardware consists of DNA restriction and ligation
Enzymes Using ATP as fuel
The reversible self-assembly is driven by hybridization
energy between input/software complementary sticky ends,
followed by an irreversible processing step i.e. an
irreversible software-directed cleavage (hydrolysis of the
Input DNA backbone)of the input molecule,which drives the computation forward by increasing entropy and releasing
heat and hence does not require ATP or heating.
The cleavage uses the restriction enzyme FokI, which serves as the hardware, to operate on a non covalent software/input hybrid.
This automaton use a fixed amount of software and hardware molecules to process any input molecule of any length without external energy supply.
This automaton demonstrate automata per µl
performing transitions per second per µl
dissipating about W/µl as heat .
CONCEPTS OF DNA COMPUTING
• DNA computing is also known as molecular computing. A DNA computer is basically a collection of specially selected DNA strands whose combinations will result in the solution to some problem, depending on the problem at hand.
• Think of DNA as software and enzymes as hardware. Put them together in a test tube. The incredible thing is that once the DNA sequence has been created, simply just add water to initiate the computation.
• DNA computer can be called as a bio-chemical reaction system where they choose specific reactions and use a program to control the order of reactions in which to trigger them.
• The promise of DNA computing is massive parallelism: with the given setup and enough DNA, one can potentially solve huge problems by parallel search. This can be much faster than a conventional computer.
DNA computers using dynamic programming could solve substantially larger instances because their large memory capacity then either conventional computers