Academic Journals Database
Disseminating quality controlled scientific knowledge

Applying Surface-Based DNA Computing for Solving the Dominating Set Problem

ADD TO MY LIST
 
Author(s): Hassan Taghipour | Mahdi Rezaei | Heydar Ali Esmaili

Journal: American Journal of Molecular Biology
ISSN 2161-6620

Volume: 02;
Issue: 03;
Start page: 286;
Date: 2012;
Original page

Keywords: Parallel Computing | Surface-Based DNA Computers | Dominating Set Problem | NP-Complete Problem

ABSTRACT
The surface-based DNA computing is one of the methods of DNA computing which uses DNA strands immobilized on a solid surface. In this paper, we applied surface-based DNA computing for solving the dominating set problem. At first step, surface-based DNA solution space was constructed by using appropriate DNA strands. Then, by application of a DNA parallel algorithm, dominating set problem was resolved in polynomial time.

Tango Rapperswil
Tango Rapperswil

     Save time & money - Smart Internet Solutions