DNA Computing: DNA Computation

1165 Words3 Pages

Introduction

DNA computing is one of the natural computing based area on the idea that molecular biology process can be used to perform arithmetic and logic operation and encoded information in DNA strands. DNA computing primarily uses DNA analogs and RNA for computational purposes. DNA computing employs a biomolecule manipulation to solve computational problems, and exploring a natural process as computational models. The idea is to encode data in DNA strands and use tools to solve a difficult computational problems.

First DNA Computation

The first DNA computing that has ever been created was occur in 1994 by Leonard Adleman, he performed the computation using strands of DNA. Leonard Adleman implement his DNA computation to solve Hamiltonian Path Problem (HPP) using brute-force algorithm. HPP is one of problem in the study of complex network and graph theory, and it belongs to the class of problem known as NP-complete. NP- complete is one of the hardest problems which include theoretical and practical significance such as network design, scheduling and data storage. So in order to solve this problem Adleman uses few approaches using DNA computing. [1]
There are three steps that has been taken by Adleman:
1) Generate strands encoding random paths
2) Remove all strands that do not encode the HP
3) Check that the remaining strands encode a solution to the HPP

In the first step each vertex and edge was assigned as 20- base sequence of DNA. The sequence signifying edges act as splints among strands representing their end points. Each oligo were combined to from strands encoding random paths through the graph. Then Fixed amount of oligo around 50 pmol were synthesized, mixed together and then added the ligase to seal any backbone...

... middle of paper ...

... of encryption named cryptography seems unreliable since it used plain text, but DNA authentication and stenography has been proven useful in the field. DNA computing has been proven to handle difficult computation problem and it still holds a possibility to solve even more complex problem and replacing the electrical computer in the future.

Reference

[1]A.Martyn(2008). DNA Computing[Online] : http://www2.docm.mmu.ac.uk/STAFF/M.Amos/Docs/dnacomp.pdf
[2]S.M Mohd, I.Zuwairie, U.Satomi, O.Osamu, K. Marzuki(2005). DNA Computing for Complex Scheduling Problem[Online]. Available : http://www.isc.meiji.ac.jp/~onosemi/IADC/ICNCSaufee.pdf
[3]C. Guangzhao, L. Cuiling, L. Xiaoguang(2010,February). DNA computing and Its Application to Information Security Field.[Online] Available: http://csis.bits-pilani.ac.in/faculty/murali/netsec-10/seminar/refs/ramakrishna3.pdf

Open Document