DNA Computing
DNA
● Memory of our body
● Has been around for
millions of year
● Consists of chemical
molecules
● Any possibility of
order
History of DNA computing
● Developed by Leonard Adleman of University of
California,USA in 1994
● In 2013 a photograph, a set of Shakespearean
sonnets and an audio of Martin Luther King Jr’s
I have a dream speech was stored in DNA
● Aug 2016 a GIF of a galloping horse
and a rider was inserted into a living
bacteria.
Why is DNA computing so unique?
Memory Storage
● A single gram of DNA with 1cm^3 volume could
hold 750 terabytes of information(Journal of
Proteomics & Bioinformatics
● It would take 47000 cd’s(1.6Gb) to match up to
the capacity of DNA!!
Unmatchable parallelism
● In each test tube we can hold trillions or
strands of DNA which can be operated on at
the same time!
● Any problem that requires us to check multiple
possibilities can be solved much quicker.
Consider a maze...
Source
● Unlike silicon, DNA is available everywhere as
long as living things exist
● Makes it a very cheap resource
● No toxic components in DNA
● Will make computers much smaller than
conventional computers
Is it competitive?
● Current algorithms in electronic computers are
too powerful and versatile
● DNA computation can only be used for specific
problems
● No method currently available for data
representation
Problems with DNA parallelism
● Time taken to solve a problem remains the
same
● Amount of DNA required increases
● Number of errors increase with the size of the
problem
● Probability of errors occurring also increases
But...
● Cost of sequencing DNA will go down as it
invariably does with all technology
● Very useful in genetic programming and nano-
technology
● Algorithms for the new DNA language are yet to
be discovered
Thank you!