Author/Authors :
ÇİĞDEM, Uğur Gaziosmanpaşa Üniversitesi - Bilgisayar Programcılığı Bölümü, Turkey , KARAKÖSE, Mehmet Fırat Üniversitesi - Bilgisayar Mühendisliği Bölümü, Turkey
Title Of Article :
DNA Computing Algorithm for NP problems
Abstract :
The numerical algorithm for DNA computing has been developed on the basis of the characteristics of the DNA molecules. Its use for the resolution of the current problems is getting common. It is capable of parallel processing and storing huge amount of data but it is difficult and costly to be implemented within the laboratory environment. In this study, Numerical DNA computing algorithm is implemented on non-polynomial problems (NP). NPs are known to be difficult problems with only a close solution rather than a definite one. The simulations conducted as part of this study have shown that NP problems can be solved more easily and quickly by the given numerical algorithm for DNA computing. The algorithm is developed upon the selection of travelling salesman and knapsack problems and its performance has been verified by the results of matlab simulations.
NaturalLanguageKeyword :
DNA computing , Travelling Salesman Problem , Knapsack.
JournalTitle :
Erciyes University Journal Of The Institute Of Science and Technology
