| dc.contributor.author |
Taghipour, Hassan |
|
| dc.contributor.author |
Rezaei, Mahdi |
|
| dc.contributor.author |
Esmaili, Heydar A. |
|
| dc.date.accessioned |
2016-10-24T14:18:12Z |
|
| dc.date.available |
2016-10-24T14:18:12Z |
|
| dc.date.issued |
2012-07 |
|
| dc.identifier.citation |
American Journal of Molecular Biology, 2012, 2, 286-290 |
en_US |
| dc.identifier.uri |
http://dx.doi.org/10.4236/ajmb.2012.23030 |
|
| dc.identifier.uri |
http://hdl.handle.net/123456789/1014 |
|
| dc.description.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. |
en_US |
| dc.language.iso |
en |
en_US |
| dc.publisher |
Scientific Research Publishing |
en_US |
| dc.subject |
Parallel Computing |
en_US |
| dc.subject |
Surface-Based DNA Computers |
en_US |
| dc.subject |
Dominating Set Problem |
en_US |
| dc.subject |
NP-Complete Problem |
en_US |
| dc.title |
Applying Surface-Based DNA Computing for Solving the Dominating Set Problem |
en_US |
| dc.type |
Article |
en_US |
