Introduction to DNA Computing and Solving NP Problems Using DNA Computing

1
Introduction to DNA Computingand Solving NP
Problems Using DNA Computing

• Presented by
• Phani
• 04/29/2009

2
Contents

• Introduction to DNA Computing
• Steps Involved in DNA Computing
• DNA Computing Vs Silicon Computing
• Hamiltonian path problem

3
Introduction

• DNA Computing is a form of Computing which uses
  DNA, biochemistry and molecular biology instead
  of traditional silicon technologies
• Introduced by Leonard M. Adleman
• For Solving Hamiltonian path problem
• Extended to solve weighted graph problem

4
Steps in DNA Computing

• The Computation is performed by a series of
  Primitive bio-molecular reactions
• Hybridization
• Denaturation
• Ligation
• Magnetic bed Separation
• Polymerase chain reaction (PCR)

5
DNA Vs Silicon Computing
6
Hamiltonian Path Problem(HPP)

• Generate random paths through the graph
• Keep only those paths which start with IN and end
  with OUT
• keep only those paths which enter n vertices
• Keep only those paths which enter all the
  vertices
• If any path is left the return YES else NO