TUMKUR UNIVERSITY

DEPARTMENT OF STUDIES AND RESEARCH IN COMPUTER SCIENCE

TOPIC : DNA Based Computing

PRESENTED BY PRESENTED TO
Shahsidara S Bhavyashree Mam
P11AZ24S126022 Lecturer
Ist Semester DoSR Computer
MCA Applications
Tumkur University,Tumkur. Tumkur University,
Tumkur.
 DNA Based Computing: Unlocking Nature's
Computational Power

Massive Parallelism Energy Efficiency

Harnessing billions of DNA strands to perform Achieving drastically lower power consumption than
computations simultaneously, enabling complex silicon-based computers, paving the way for highly
problem-solving at an unprecedented scale. efficient and sustainable computation.
 Introduction to DNA Computing

Fundamental Concept How It Works Why DNA Computing?

DNA computing is a novel It leverages the natural Proposed as an alternative or
computing paradigm that uses properties of DNA, such as complement to traditional
deoxyribonucleic acid (DNA) base pairing (A-T, C-G) and silicon-based electronic
molecules to perform enzyme-catalyzed reactions, computers, especially for
calculations. to effectively store and problems intractable for
process information. conventional machines.
 Why DNA? Unprecedented Advantages

Massive Parallelism Extremely Low Power High Information

Consumption Density
Trillions of DNA molecules can DNA can store vast amounts
perform computations DNA reactions occur at of data. Theoretically, one
simultaneously. A single test molecular scales, requiring gram of DNA can store more
tube can contain more significantly less energy information than a trillion CDs,
computational units than all (femtojoules per operation) potentially reaching
silicon computers ever built. compared to electronic circuits petabytes.
(picojoules).
 Core Principles: DNA as Data Storage

The Genetic Alphabet Encoding Example

DNA's four nucleotide bases – Information (e.g., binary code) A 0 might be represented by
Adenine (A), Thymine (T), is encoded by synthesizing AT, and a 1 by CG in a binary
Cytosine (C), Guanine (G) – custom DNA strands with system, or more complex
serve as the fundamental bits specific sequences of these encoding schemes are used
of information. bases. for specific problems.
 Core Principles: DNA as Computational
Operations

Hybridization Ligation Restriction

Complementary DNA strands DNA ligase enzymes can join Restriction enzymes cut DNA
bind together (e.g., A to T, C two DNA strands together, at specific recognition
to G), forming double helices. representing a concatenation sequences, enabling
This is analogous to logical or assembly operation. separation or filtering
AND or matching operations. operations.
 Adleman's Experiment (1994): The Pioneering
Work

Leonard Adleman HPP Solved with DNA Proof-of-Concept

Of USC first demonstrated the Successfully used DNA to Solved a 7-city instance of
practical viability of DNA solve a small instance of the HPP, demonstrating proof-of-
computing. Hamiltonian Path Problem concept for DNA's massive
(HPP) – a notoriously difficult parallel search capabilities.
(NP-complete) problem for
conventional computers.
How Adleman's Experiment Worked (Simplified)

DNA Encoding Generating All Paths Filtering for Solutions

Each city was assigned a Through random ligation in a Molecular techniques like PCR
unique DNA strand, and paths test tube, all possible paths and gel electrophoresis were
connecting cities were (combinations of city DNA used to isolate only the DNA
represented by other DNA strands) were simultaneously strands representing valid
segments designed to bind generated. Hamiltonian paths.
them.
 Key Strengths: Leveraging DNA's Unique
Properties

Massive Parallelism High Storage Density Low Energy Footprint

A single microliter solution One cubic centimeter of DNA DNA operations occur in
contains trillions of DNA can store more than 10^18 aqueous solutions at room
molecules, each executing an electronic bits, substantially temperature, leading to
operation simultaneously. This surpassing the data density of minimal heat dissipation and
capability allows for the conventional hard drives. significantly lower energy
exploration of vast solution consumption compared to
spaces at once. silicon-based computing.
 Challenges and Limitations

01 02 03
Slower Processing Higher Error Rates Scalability and
Speed Practicality
Individual DNA operations Biochemical reactions are Managing and interpreting
occur in milliseconds, inherently susceptible to results from complex DNA
considerably slower than the errors, necessitating reactions for large problems,
nanosecond speeds of sophisticated error-correction along with the labor-intensive
electronic computations. mechanisms to ensure result laboratory setup, presents a
accuracy. major hurdle.
 Current Applications and Research Areas

Solving NP-hard Drug Discovery & Smart Therapeutics

Problems Diagnostics
Ongoing research explores Emerging work focuses on
DNA algorithms to tackle DNA computers function as developing DNA-based
computationally challenging biosensors, enabling the systems for highly
problems like Satisfiability detection of specific targeted drug delivery,
(SAT), the Traveling molecules or pathogens and disease detection, and
Salesperson problem, and executing logical precise therapeutic
set cover. operations based on their interventions.
presence for advanced
diagnostics.
Current Applications and Research Areas (Cont.)

01 02 03
Molecular Biosensors Programmable Algorithmic Self-
Nanobots Assembly
Designing DNA strands to Developing DNA Leveraging DNA's inherent
bind specific disease markers, nanomachines capable of self-assembly properties to
such as those found in cancer autonomous navigation within create intricate
cells, to execute biological environments to nanostructures with
computations that trigger perform precise tasks like predefined shapes and
diagnostic signals or targeted drug delivery or functionalities, extending
therapeutic actions. manipulating cells. beyond pure computation.
 DNA Nanotechnology and Self-Assembly

Beyond Computation DNA Origami

DNA's unique base-pairing rules make it an ideal A technique where a long single strand of DNA
material for constructing intricate nanoscale is folded into a precise 2D or 3D shape, guided
structures. by hundreds of shorter 'staple' strands.
DNA Nanotechnology and Self-Assembly (Cont.)

DNA Origami Self-Assembly Principles

Pioneered in 2006, this technique enables the Leverages DNA's inherent base-pairing
creation of precise nanostructures, such as properties (Adenine-Thymine, Guanine-Cytosine)
smiley faces, maps, and molecular robots, by to enable the spontaneous and precise
intricately folding a long DNA strand using formation of complex nanoscale structures from
numerous short staple strands. individual DNA strands.
 Future Prospects: Hybrid Systems &
Biocomputers

Hybrid Architectures Biological Computing Synthetic Biology

Integration
Combine DNA computing's Develop autonomous DNA-
parallelism and density with based devices operating Design biological systems to
traditional electronics' speed within living systems for in- perform complex
and control. Silicon chips vivo diagnostics or computations directly within
manage I/O and control, while therapeutics. cells, blurring the lines
DNA executes parallel between computation and life.
computations.
 Conclusion: The Promise and Road Ahead

Core Strengths of DNA Challenges & Future Complementary

Computing Potential Technology
DNA computing is poised to
Represents a fascinating and While challenges persist in complement, not replace,
powerful approach to speed, error rates, and traditional silicon-based
computation, offering practical implementation for systems. It opens new
immense parallelism, high large-scale problems, ongoing avenues for solving previously
storage density, and research continues to advance intractable problems and
significant energy efficiency. the field. Its greatest potential revolutionizing fields like
lies in niche applications medicine and materials
requiring massive parallel science.
searches, bioinformatics,
smart diagnostics, and
nanotechnology.