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
-
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) -
Generic DNA encoding design scheme to solve combinatorial problems
by: Rofilde, Hasudungan
Published: (2015) -
Parallel Platform For New Secure Stream Ciphers Based On Np-hard Problems
by: Mohammad A. Suwais, Khaled
Published: (2009) -
An optical fiber network oracle for NP-complete problems
by: Shum, Perry Ping, et al.
Published: (2015)