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...
Main Authors: | Hasudungan, Rofilde, Rohani, Abu Bakar, Rozlina, Mohamed |
---|---|
Format: | Conference or Workshop Item |
Language: | English |
Published: |
2013
|
Subjects: | |
Online Access: | http://umpir.ump.edu.my/id/eprint/5302/1/40_ump.pdf |
Similar Items
-
Generic DNA encoding design scheme to solve combinatorial problems
by: Rofilde, Hasudungan
Published: (2015) -
DNA Computing Technique to Solve Vertex Coloring Problem
by: Hasudungan, Rofilde, et al.
Published: (2013) -
DNA Computing for Solving Distribution Center Location Problem
by: Hasudungan, Rofilde, et al.
Published: (2013) -
A Review on Soft Computing Technique in Intrusion Detection System
by: Sulaiman, Noor Suhana, et al.
Published: (2012) -
Direct-proportional length-based DNA computing implementation for elevator scheduling problem
by: Muhammad, Mohd. Saufee, et al.
Published: (2007)