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...

Full description

Bibliographic Details
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/
http://umpir.ump.edu.my/id/eprint/5302/1/40_ump.pdf
_version_ 1848817572052467712
author Hasudungan, Rofilde
Rohani, Abu Bakar
Rozlina, Mohamed
author_facet Hasudungan, Rofilde
Rohani, Abu Bakar
Rozlina, Mohamed
author_sort Hasudungan, Rofilde
building UMP Institutional Repository
collection Online Access
description 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.
first_indexed 2025-11-15T01:23:54Z
format Conference or Workshop Item
id ump-5302
institution Universiti Malaysia Pahang
institution_category Local University
language English
last_indexed 2025-11-15T01:23:54Z
publishDate 2013
recordtype eprints
repository_type Digital Repository
spelling ump-53022018-05-22T03:11:06Z http://umpir.ump.edu.my/id/eprint/5302/ DNA Computing and Its Application on NP Completeness Problem Hasudungan, Rofilde Rohani, Abu Bakar Rozlina, Mohamed QA75 Electronic computers. Computer science 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. 2013 Conference or Workshop Item PeerReviewed application/pdf en http://umpir.ump.edu.my/id/eprint/5302/1/40_ump.pdf Hasudungan, Rofilde and Rohani, Abu Bakar and Rozlina, Mohamed (2013) DNA Computing and Its Application on NP Completeness Problem. In: The 3rd International Conference on Software Engineering & Computer Systems (ICSECS 2013) , 20-22 August 2013 , Bukit Gambang Resort City, Kuantan, Pahang. pp. 1-9., 4 (3). (Published) doi:10.1016/S2222-1808(14)60538-7
spellingShingle QA75 Electronic computers. Computer science
Hasudungan, Rofilde
Rohani, Abu Bakar
Rozlina, Mohamed
DNA Computing and Its Application on NP Completeness Problem
title DNA Computing and Its Application on NP Completeness Problem
title_full DNA Computing and Its Application on NP Completeness Problem
title_fullStr DNA Computing and Its Application on NP Completeness Problem
title_full_unstemmed DNA Computing and Its Application on NP Completeness Problem
title_short DNA Computing and Its Application on NP Completeness Problem
title_sort dna computing and its application on np completeness problem
topic QA75 Electronic computers. Computer science
url http://umpir.ump.edu.my/id/eprint/5302/
http://umpir.ump.edu.my/id/eprint/5302/
http://umpir.ump.edu.my/id/eprint/5302/1/40_ump.pdf