Applying Surface-Based DNA Computing for Solving the Dominating Set Problem英文文献资料.docVIP

American Journal of Molecular Biology, 2012, 2, 286-290 AJMB /10.4236/ajmb.2012.23030 Published Online July 2012 (http://www.SciRP.org/journal/ajmb/) Applying surface-based DNA computing for solving the dominating set problem Hassan Taghipour , Mahdi Rezaei , Heydar Ali Esmaili 1* 2 1 1 2 Department of Pathology, Tabriz University of Medical Sciences, Tabriz, Iran Department of Theoretical Physics and Astrophysics, Tabriz University, Tabriz, Iran Email: taghipourh@ * Received 19 May 2012; revised 4 June 2012; accepted 25 June 2012 ABSTRACT solving the dominating set problem which is one of the NP-complete problems. Dominating set problem is widely used in network routing, city planning, designing and construction of health services in appropriate places. The paper is organized as follows. Section 2 intro- duces the DNA structure and various DNA computing models and discuss about surface-based DNA computing and biological operations which are used in surface- based model. Section 3 introduces a DNA based algo- rithm for solving the dominating set problem in sur- face-based model. The surface-based DNA computing is one of the me- thods of DNA computing which uses DNA strands immobilized on a solid surface. In this paper, we ap- plied surface-based DNA computing for solving the dominating set problem. At first step, surface-based DNA solution space was constructed by using appro- priate DNA strands. Then, by application of a DNA parallel algorithm, dominating set problem was re- solved in polynomial time. Keywords: Parallel Computing; Surface-Based DNA Computers; Dominating Set Problem; NP-Complete Problem 2. BASICS OF DNA COMPUTING 2.1. Structure of DNA and DNA Computing Models 1. INTRODUCTION DNA consists of two long polymers of simple units called nucleotides. Nucleotides ar