DNA Computing and Its Application on NP Completeness Problem
Abstract. DNA computing is emerging research area that attracts many researchers in multidiscipline area range from biology, physics, mathematics, and computer science. Nowadays, many researchers already solved problem using this technique, mostly classified as NP (Nondeterministic Polynomial) probl...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Conference or Workshop Item |
| Language: | English |
| Published: |
2013
|
| Subjects: | |
| Online Access: | http://umpir.ump.edu.my/id/eprint/5302/1/40_ump.pdf http://umpir.ump.edu.my/id/eprint/5302/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | Abstract. DNA computing is emerging research area that attracts many researchers in multidiscipline area range from biology, physics, mathematics, and computer science. Nowadays, many researchers already solved problem using this technique, mostly classified as NP (Nondeterministic Polynomial) problem since the inheritance of DNA computing in processing simultaneously and it huge memory capacity. Despite very promising, DNA computing faces several obstacles such as exponential solution explosion, representing weight etc. This paper aim is to give a review on current achievement on DNA computing upon NP-completeness problem. |
|---|