DNA Computing and Its Application on NP Completeness Problem

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


Download (467kB)


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.

Item Type: Conference or Workshop Item (Speech)
Uncontrolled Keywords: DNA computing; NP problem; DNA strands; Data representation on DNA strands
Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Faculty/Division: Faculty of Computer System And Software Engineering
Depositing User: Noorul Farina Arifin
Date Deposited: 16 Apr 2014 06:08
Last Modified: 22 May 2018 03:11
URI: http://umpir.ump.edu.my/id/eprint/5302
Download Statistic: View Download Statistics

Actions (login required)

View Item View Item