SlideShare a Scribd company logo
3
Most read
5
Most read
6
Most read
Presentation
On
DNA Computing
Presented By:
Shoaib Nusrat
BCA V SEM
GH5204
15CAB03
Under Supervision of:
Prof. M.U. Bokhari
Prof. R.Z. Khan
Dr. Swaleha Zubair
Mrs. Sajida Khatoon
Mr. Mohd. Zeyauddin
CONTENT
 Introduction
 Need for DNA Computing
 Limitations / Current Problems
 Applications of DNA Computing
 Advantages of DNA Computing
 Disadvantages of DNA Computing
 Some pictures stored in DNA Hard drive and
successfully retrieved
 The Future!
 Conclusion
 References
INTRODUCTION
What is DNA Computing ?
 A DNA computer, as the name implies, uses DNA
strands to store information.
 It use recombinative properties of DNA to perform
operations.
 A small test tube of DNA strands suspended in a
solution could yield millions to billions of
simultaneous interactions at speeds — in theory—
faster than today's fastest supercomputers.
 Each DNA strand represents a processor !
HISTORY
 This field was initially developed by Leonard
Adleman of the University of Southern
California, in 1994.
 Adleman demonstrated a proof-of-concept use of
DNA as a form of computation which solved the
seven-point Hamiltonian path problem.
 Since the initial Adleman experiments, advances
have been made and various Turing machines
have been proven to be constructible.
BASICS AND ORIGIN OF DNA COMPUTING
 DNA computing is utilizing the property of DNA for
massively parallel computation.
 With an appropriate setup and enough DNA, one can
potentially solve huge problems by parallel search.
 Utilizing DNA for this type of computation can be much
faster than utilizing a conventional computer.
 Leonard Adleman proposed that the makeup of DNA and
its multitude of possible combining nucleotides could
have application in computational research techniques.
NEED FOR DNA COMPUTING
 Conventional or traditional silicon based computers have
a limited speed and beyond a point cannot be
miniaturize.
 Information storage capacity of DNA molecule is much
higher than the silicon chips. One cubic nanometer of
DNA is sufficient to store 1bit information
 Operations on DNA computing are parallel, test tube of
DNA may contain around trillions of strands. Each
operation is carried out in all the strands present in the
test tube parallel.
 1 gram of DNA can store a huge amount of data such as
1 �- 1014 MB of data; to listen to the same amount of
data stored in a CD will require 163,000 centuries.
LIMITATIONS / CURRENT PROBLEMS
 It involves a relatively large amount of error.
 Requires human assistance.
 Time consuming laboratory procedures.
 No universal method of data representation .
APPLICATIONS OF DNA COMPUTING
 DNA chips
 Genetic programming
 Pharmaceutical applications
 Cracking of coded messages
 DNA fingerprinting
SOME PICTURES STORED IN DNA HARD
DRIVE AND SUCCESSFULLY RETRIEVED
ADVANTAGES OF DNA COMPUTING
 Perform millions of operations simultaneously.
 Generate a complete set of potential solutions.
 Conduct large parallel searches.
 Efficiently handle massive amounts of working memory.
 Cheap, clean, readily available materials.
 Amazing ability to store information.
DISADVANTAGES OF DNA COMPUTING
 Generating solution sets, even for some
relatively simple problems, may require
impractically large amounts of memory (lots and
lots of DNA strands are required)
 DNA computers could not (at this point) replace
traditional computers.
 They are not programmable and the average
dunce can not sit down at a familiar keyboard
and get to work.
THE FUTURE!
 Algorithm used by Adleman for the traveling
salesman problem was simple. As technology
becomes more refined, more efficient algorithms
may be discovered.
 DNA Manipulation technology has rapidly improved
in recent years, and future advances may make DNA
computers more efficient.
 DNA computers are unlikely to feature word
processing, emailing and solitaire programs.
 Instead, their powerful computing power will be
used for areas of encryption, genetic programming,
language systems, and algorithms or by airlines
wanting to map more efficient routes. Hence better
applicable in only some promising areas.
CONCLUSION
 Many issues to be overcome to produce a useful DNA
computer.
 It will not replace the current computers because it is
application specific, but has a potential to replace the
high-end research oriented computers in future.
REFERENCES
 www.google.com
 www.wikipedia.com
QUERIES
Thanks

More Related Content

PPTX
Data Storage in DNA
PPTX
DNA Based Computing
PPTX
DNA Origami
PPTX
HIV AIDS
ODP
The Full Stack Web Development
PDF
Protein engineering
PPTX
Presentation: Hydrogel
Data Storage in DNA
DNA Based Computing
DNA Origami
HIV AIDS
The Full Stack Web Development
Protein engineering
Presentation: Hydrogel

What's hot (20)

PPTX
DNA computing
PPT
Dna computing
PPTX
DNA computing seminar
PPTX
Dna computing
PPTX
DNA Computing
PPTX
Entrez databases
PPT
DNA computing
PPTX
Bio computing
PPTX
Scop database
PPTX
DNA STORAGE
PDF
The ensembl database
PPT
Primary, secondary, tertiary biological database
PPTX
Dna computing
PPT
PPTX
Dna digital data storage
PDF
Bioinformatics data mining
PPTX
Introduction to Bioinformatics
PPTX
Nucleic acid and protein databanks
PPTX
Protein Data Bank
PDF
DNA computing
Dna computing
DNA computing seminar
Dna computing
DNA Computing
Entrez databases
DNA computing
Bio computing
Scop database
DNA STORAGE
The ensembl database
Primary, secondary, tertiary biological database
Dna computing
Dna digital data storage
Bioinformatics data mining
Introduction to Bioinformatics
Nucleic acid and protein databanks
Protein Data Bank
Ad

Similar to Dna computing (20)

PPTX
DNA computing.pptx
PPT
Dna computing
PPTX
Dna computing
PPTX
DNA Computing
PPTX
DNA based computer : present & future
PPTX
Dna computing
PPTX
Alternative Computing
DOC
Recent Advancements in DNA Computing
PPTX
Datastorage in DNA
PPTX
Datastorage in DNA
PPTX
Dna computing
PPT
Dna computers
PPTX
Dna storage
PPT
DNA & Bio computer
PPTX
DNA Storage
PDF
biocomputing-140723074801-phpapp01.pdf
PPTX
Power point presentation of saminer topic DNA based computing
PPT
Seminar PPT on DNA Data Storage.ppt
PPT
Nano technology
DNA computing.pptx
Dna computing
Dna computing
DNA Computing
DNA based computer : present & future
Dna computing
Alternative Computing
Recent Advancements in DNA Computing
Datastorage in DNA
Datastorage in DNA
Dna computing
Dna computers
Dna storage
DNA & Bio computer
DNA Storage
biocomputing-140723074801-phpapp01.pdf
Power point presentation of saminer topic DNA based computing
Seminar PPT on DNA Data Storage.ppt
Nano technology
Ad

Recently uploaded (20)

PDF
CISA (Certified Information Systems Auditor) Domain-Wise Summary.pdf
PDF
advance database management system book.pdf
PDF
Τίμαιος είναι φιλοσοφικός διάλογος του Πλάτωνα
PPTX
20th Century Theater, Methods, History.pptx
PDF
IGGE1 Understanding the Self1234567891011
PDF
Paper A Mock Exam 9_ Attempt review.pdf.
PDF
Empowerment Technology for Senior High School Guide
PDF
LDMMIA Reiki Yoga Finals Review Spring Summer
PDF
Weekly quiz Compilation Jan -July 25.pdf
PDF
Environmental Education MCQ BD2EE - Share Source.pdf
PPTX
TNA_Presentation-1-Final(SAVE)) (1).pptx
PPTX
Onco Emergencies - Spinal cord compression Superior vena cava syndrome Febr...
PDF
Complications of Minimal Access-Surgery.pdf
PPTX
Introduction to pro and eukaryotes and differences.pptx
PDF
medical_surgical_nursing_10th_edition_ignatavicius_TEST_BANK_pdf.pdf
PDF
BP 704 T. NOVEL DRUG DELIVERY SYSTEMS (UNIT 1)
PPTX
A powerpoint presentation on the Revised K-10 Science Shaping Paper
PDF
AI-driven educational solutions for real-life interventions in the Philippine...
PPTX
History, Philosophy and sociology of education (1).pptx
PDF
Vision Prelims GS PYQ Analysis 2011-2022 www.upscpdf.com.pdf
CISA (Certified Information Systems Auditor) Domain-Wise Summary.pdf
advance database management system book.pdf
Τίμαιος είναι φιλοσοφικός διάλογος του Πλάτωνα
20th Century Theater, Methods, History.pptx
IGGE1 Understanding the Self1234567891011
Paper A Mock Exam 9_ Attempt review.pdf.
Empowerment Technology for Senior High School Guide
LDMMIA Reiki Yoga Finals Review Spring Summer
Weekly quiz Compilation Jan -July 25.pdf
Environmental Education MCQ BD2EE - Share Source.pdf
TNA_Presentation-1-Final(SAVE)) (1).pptx
Onco Emergencies - Spinal cord compression Superior vena cava syndrome Febr...
Complications of Minimal Access-Surgery.pdf
Introduction to pro and eukaryotes and differences.pptx
medical_surgical_nursing_10th_edition_ignatavicius_TEST_BANK_pdf.pdf
BP 704 T. NOVEL DRUG DELIVERY SYSTEMS (UNIT 1)
A powerpoint presentation on the Revised K-10 Science Shaping Paper
AI-driven educational solutions for real-life interventions in the Philippine...
History, Philosophy and sociology of education (1).pptx
Vision Prelims GS PYQ Analysis 2011-2022 www.upscpdf.com.pdf

Dna computing

  • 1. Presentation On DNA Computing Presented By: Shoaib Nusrat BCA V SEM GH5204 15CAB03 Under Supervision of: Prof. M.U. Bokhari Prof. R.Z. Khan Dr. Swaleha Zubair Mrs. Sajida Khatoon Mr. Mohd. Zeyauddin
  • 2. CONTENT  Introduction  Need for DNA Computing  Limitations / Current Problems  Applications of DNA Computing  Advantages of DNA Computing  Disadvantages of DNA Computing  Some pictures stored in DNA Hard drive and successfully retrieved  The Future!  Conclusion  References
  • 3. INTRODUCTION What is DNA Computing ?  A DNA computer, as the name implies, uses DNA strands to store information.  It use recombinative properties of DNA to perform operations.  A small test tube of DNA strands suspended in a solution could yield millions to billions of simultaneous interactions at speeds — in theory— faster than today's fastest supercomputers.  Each DNA strand represents a processor !
  • 4. HISTORY  This field was initially developed by Leonard Adleman of the University of Southern California, in 1994.  Adleman demonstrated a proof-of-concept use of DNA as a form of computation which solved the seven-point Hamiltonian path problem.  Since the initial Adleman experiments, advances have been made and various Turing machines have been proven to be constructible.
  • 5. BASICS AND ORIGIN OF DNA COMPUTING  DNA computing is utilizing the property of DNA for massively parallel computation.  With an appropriate setup and enough DNA, one can potentially solve huge problems by parallel search.  Utilizing DNA for this type of computation can be much faster than utilizing a conventional computer.  Leonard Adleman proposed that the makeup of DNA and its multitude of possible combining nucleotides could have application in computational research techniques.
  • 6. NEED FOR DNA COMPUTING  Conventional or traditional silicon based computers have a limited speed and beyond a point cannot be miniaturize.  Information storage capacity of DNA molecule is much higher than the silicon chips. One cubic nanometer of DNA is sufficient to store 1bit information  Operations on DNA computing are parallel, test tube of DNA may contain around trillions of strands. Each operation is carried out in all the strands present in the test tube parallel.  1 gram of DNA can store a huge amount of data such as 1 �- 1014 MB of data; to listen to the same amount of data stored in a CD will require 163,000 centuries.
  • 7. LIMITATIONS / CURRENT PROBLEMS  It involves a relatively large amount of error.  Requires human assistance.  Time consuming laboratory procedures.  No universal method of data representation .
  • 8. APPLICATIONS OF DNA COMPUTING  DNA chips  Genetic programming  Pharmaceutical applications  Cracking of coded messages  DNA fingerprinting
  • 9. SOME PICTURES STORED IN DNA HARD DRIVE AND SUCCESSFULLY RETRIEVED
  • 10. ADVANTAGES OF DNA COMPUTING  Perform millions of operations simultaneously.  Generate a complete set of potential solutions.  Conduct large parallel searches.  Efficiently handle massive amounts of working memory.  Cheap, clean, readily available materials.  Amazing ability to store information.
  • 11. DISADVANTAGES OF DNA COMPUTING  Generating solution sets, even for some relatively simple problems, may require impractically large amounts of memory (lots and lots of DNA strands are required)  DNA computers could not (at this point) replace traditional computers.  They are not programmable and the average dunce can not sit down at a familiar keyboard and get to work.
  • 12. THE FUTURE!  Algorithm used by Adleman for the traveling salesman problem was simple. As technology becomes more refined, more efficient algorithms may be discovered.  DNA Manipulation technology has rapidly improved in recent years, and future advances may make DNA computers more efficient.  DNA computers are unlikely to feature word processing, emailing and solitaire programs.  Instead, their powerful computing power will be used for areas of encryption, genetic programming, language systems, and algorithms or by airlines wanting to map more efficient routes. Hence better applicable in only some promising areas.
  • 13. CONCLUSION  Many issues to be overcome to produce a useful DNA computer.  It will not replace the current computers because it is application specific, but has a potential to replace the high-end research oriented computers in future.