DNA Computers.

Slides:



Advertisements
Similar presentations
Ashish Gupta Ashish Gupta Unremarkable Problem, Remarkable Technique Operations in a DNA Computer DNA : A Unique Data Structure ! Pros.
Advertisements

DNA Computing COMP308 I believe things like DNA computing will eventually lead the way to a “molecular revolution,” which ultimately will have a very dramatic.
DNA Computation Hiroshi Higuchi.
DNA COMPUTING Presented by: Subhash Mishra Raghvendra Pandey
Enrique Blanco - imim.es © 2006 Enrique Blanco (2006) A few ideas about DNA computing.
DNA Computing By Thierry Metais
DNA Computing Computation with the Code of Life Michael Ang Interactive Telecommunications Program New York University February 16,
1 DNA Computing: Concept and Design Ruoya Wang April 21, 2008 MATH 8803 Final presentation.
DNA as a solution of computational problems Radosław Łazarz
The small sample of DNA serves as template for DNA polymerase Make complementary primers Add primers in more than 1000-fold excess Heat to make ssDNA,
Natural Computation: computational models inspired by nature Dr. Daniel Tauritz Department of Computer Science University of Missouri-Rolla CS347 Lecture.
DNA Computing DCS 860A-2008 Team 3 December 20, 2008 Marco Hernandez, Jeff Hutchinson, Nelson Kondulah, Kevin Lohrasbi, Frank Tsen.
FUTURE COMPUTERS By - Kapil jadhav. History of Computers. Long and a fascinating history. Started with huge and complicated machines. First, second, third.
Thinking of Studying Biological Sciences? Dr Amrit Mudher Lecturer in Neurosciences School of Biological Sciences University of Southampton
Evolutionary Computation Instructor: Shu-Mei Guo Nature Inspired Algorithmic Techniques.
WELCOME PRESENTED BY SUKHILA .K.
1 Bio + Informatics AAACTGCTGACCGGTAACTGAGGCCTGCCTGCAATTGCTTAACTTGGC An Overview پرتال پرتال بيوانفورماتيك ايرانيان.
SEMINAR ON BIOMOLECULAR COMPUTING
DNA Computing on a Chip Mitsunori Ogihara and Animesh Ray Nature, vol. 403, pp Cho, Dong-Yeon.
RSA Encryption System.
Lesson Overview Lesson Overview Studying the Human Genome Lesson Overview 14.3 Studying the Human Genome.
Beyond Silicon: Tackling the Unsolvable with DNA.
1 Computing with DNA L. Adelman, Scientific American, pp (Aug 1998) Note: This ppt file is based on a student presentation given in October, 1999.
BY CLAYTON PETTY Leonard Max Adleman. Background Born Dec. 31, 1945 in California Attended UC Berkeley  BA in Mathematics in 1968  Ph.D. in EECS in.
DNA Computing BY DIVYA TADESERA. Contents  Introduction  History and its origin  Relevancy of DNA computing in 1. Hamilton path problem(NP problem)
Algorithms and their Applications CS2004 ( ) Dr Stephen Swift 1.2 Introduction to Algorithms.
Science Observe the world. Identify and state the Problem Research State the Hypothesis Design the Procedure Make an observation and Record Data Organize.
Extra. 1Introduction 2Theoretical background Biochemistry/molecular biology 3Theoretical background computer science 4History of the field 5Splicing systems.
Tutor: Prof. Lucia Pomello Supervisors: Prof. Giancarlo Mauri Dr. Luciano Milanesi PhD Thesis Proposal Membrane systems: a framework for stochastic processes.
Bioinformatics Education at North Central College Caroline St.Clair Professor of Computer Science.
BIO COMPUTERS. INTRODUCTION  Growing needs of mankind-Rapid Development.  Rapid advancement in computer technology will lose its momentum when silicon.
Anton Supercomputer Brandon Dean 4/28/15. History Named after Antonie van Leeuwenhoek – “father of microbiology” Molecular Dynamics (MD) simulations were.
LIVING COMPUTERS! (At least very basic computations run by bacteria) Shunzaburo Kida Biomedical Engineering April 2010 BME 482.
Prepared By :. CONTENTS 1~ INTRODUCTION 2~ WHAT IS BLUE BRAIN 3~ WHAT IS VIRTUAL BRAIN 4~ FUNCTION OF NATURAL BRAIN 5~ BRAIN SIMULATION 6~ CURRENT RESEARCH.
Introduction to DNA Computing Russell Deaton Electrical Engineering The University of Memphis Memphis, TN Stephen A. Karl Department.
What is DNA Computing? Shin, Soo-Yong Artificial Intelligence Lab.
Biological Electronics and Computation
DNA Computing Dr Manohar Chandwani IET-DAVV, Indore
What is Science? Note: not part of notes What are the limits to science? What are the limits to science?
Computation through DNA Jason Meador GST 400 – What is Thought? April 24, 2006.
EvoNet Flying Circus Introduction to Evolutionary Computation Brought to you by (insert your name) The EvoNet Training Committee The EvoNet Flying Circus.
DNA COMPUTING SUBMITTED BY::: VIKAS AGARWAL CO-2.
Artificial intelligence
Biochemistry : Chemistry in biological systems. Biochemistry is the study of the chemical processes and transformations in living organisms Key metabolic.
PROCESSING DNA TOKENS IN PARALLEL COMPUTING Presented by Sapnah Aligeti Midwestern State University 27 June 2005.
Chapter One Biology: The Study of Life. I. Biology is the study of Life.
Simulation of a DNA Renaturalization process R.Baños, P. Cordero, A.Goñi and J.Castellanos Universidad Politécnica de Madrid International Conference on.
Future directions in computing Future directions in computing Проект по английскому языку Выполнил: Жеков Виктор, ученик 9 Б класса ученик 9 Б класса Руководитель:
DNA computing on a chip Mitsunori Ogihara and Animesh Ray Nature, 2000 발표자 : 임예니.
1 Biological Computing – DNA solution Presented by Wooyoung Kim 4/8/09 CSc 8530 Parallel Algorithms, Spring 2009 Dr. Sushil K. Prasad.
(Potentials and advancements) Submitted to - Presented by- Mrs. Neeta Nain Vikas Kumar Khichar Mrs. Namita Mittal 2008ucp149 1 VI Semester(CP-2)
Towards Autonomous Molecular Computers Towards Autonomous Molecular Computers Masami Hagiya, Proceedings of GP, Nakjung Choi
Quantum Computing: An Introduction Khalid Muhammad 1 History of Quantum Computing Bits and Qubits Problems with the Quantum Machine.
Page 1 PRESENTATION ON DNA COMPUTING By LAKSHMI PRIYANKA M, BHARGAVI S.
BY PENNY CROMER WEB 110-L01 Organic Molecular Computer.
The future revolution By P.Ajay & M.SANTOSH. contents  What is nano-technology  Origin  Production  Tools of nano-technology  Applications  Disadvantages.
G.PULLAIAH COLLEGE OF ENGINEERING & TECHNOLOGY. BLUE BRAIN Prepared by, Prepared by, D. Sruthi Reddy, D. Sruthi Reddy, 08AT1A0521, 08AT1A0521, 2 nd CSE.
DNA Computing Guided by: Ms. Leena Patel Computer Engineering Prepared by: Devharsh Trivedi
Biology 1 – Big Ideas. I. Organisms share common characteristics of life. (Chapter 1) Essential Question: How do we know if something is alive?

DNA Computing. What is it?  “DNA computing is a branch of computing which uses DNA, biochemistry, and molecular biology hardware, instead of the traditional.
A PRESENTATION ON DNA COMPUTING Presented By SOMYA JAIN.
BLUE BRAIN The future technology
HOW NATURE BEAT US TO THE SUPERCOMPUTER MARTIN HANZEL
DNA computing on surfaces
What is Science?.
WELCOME TO ALL.
G.PULLAIAH COLLEGE OF ENGINEERING & TECHNOLOGY
By:- Manas Pandey Electrnics & Communication Roll No
DNA Solution of Hard Computational Problems
Presentation transcript:

DNA Computers

Outline What is DNA Computing << DNAC >> ? History of DNA Computing. Adleman's DNA Computer. Advantages and disadvantages. The Future of DNA Computing. Conclusion.

DNA Computing also known as molecular computing DNA computing is a form of computing which uses DNA, biochemistry and molecular biology, instead of traditional silicon-based computer technologies. Its one of the Fast growing fields in both CS and Biology. the use of DNA molecules in computers 

History "Computers in the future may weigh no more than 1.5 tons" in 1994, Leonard Adleman used the DNA as a form of computation to solve the Seven-Point Hamiltonian Path Problem in 2002, researchers from the Weizmann Institute of Science, Israel, unveiled a programmable molecular computing machine composed of enzymes and DNA molecules on April 28, 2004, they announced in the journal Nature that they had constucted a DNA computer.this was coupled with an input and output module and is capable of diagnosing cancerous activity within a cell, and then releasing an anti cancer drug upon diagnosis

Adleman's DNA Computer: the Seven-Point Hamiltonian Path Problem the objective is to find a path from Start to end going through all the points only once.

Advantages Tremendous memory storage. Inexpensive to build. the genetic information carried in a human cell would fill a book of more than 500,000 pages. Inexpensive to build. Less energy consumption. Incomparable computational power Massively Parallel Nature: while DNA can only carry out computations slowly, DNA computers can perform a staggering number of calculations simultaneously in order of 109 calculations per second.

Disadvantages Although Adleman's first application took only milliseconds to produce a solution, it took about a week to fish the solution molecules out from the rest of possible path molecules that had formed. DNA splicing and selection equipment needs to be refined for this purpose. There is also no guarantee that the solution produced will be the absolute best solution. It couldn't replace traditional computers. Not programmable, however, research is ongoing in doing boolean logic with DNA and designing universal programmable DNA Computers.

The Future of DNA Computing. University of Southern California, with Dr. Adleman and Princeton University with Dr. Richard Lipton and some graduated students, are developing new branches in this field like Cryptography. They works on decreasing error and damage to the DNA during computations. In his article "Speeding Up Computation via Molecular Biology" Lipton shows how DNA can be used to construct a Turning machine, a universal computer capable of performing any calculation, but its all only in theory.

Conclusion  The Field of DNA Computing is truly exciting for the revolution implies will occur within the next few years. A computer scientist can mess around with biology equipment and come up with something new and valuable.

References:  [1] DIMACS Proceedings: DNA Based Computers I (#27), II (#44), III (#48), IV (Special Issue of Biosystems), V(MIT, June 1999)  [2] Other: Genetic Programming 1 (Stanford, 1997), Genetic Programming 2 (Wisconsin-Madison, 1998), IEEE International Conference on Evolutionary Computation (Indianapolis, 1997)  [3] Richard P. Feynman, There's Plenty of Room at the Bottom. In D. Gilbert, ed., Miniaturization, 282-296. Reinhold (1961)  [4] Leonard Adleman, Molecular computation of solutions to combinatorial problems. Science 266, 1021-1024 (1994)  [5] Dr. Karron's Bioinformatics web class 2006.

THANKS =)