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

Simple item page
dc.contributor.authorTaghipour, Hassan
dc.contributor.authorRezaei, Mahdi
dc.contributor.authorEsmaili, Heydar A.
dc.date.accessioned2016-10-24T14:18:12Z
dc.date.available2016-10-24T14:18:12Z
dc.date.issued2012-07
dc.description.abstractThe 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.identifier.citationAmerican Journal of Molecular Biology, 2012, 2, 286-290en_US
dc.identifier.urihttp://dx.doi.org/10.4236/ajmb.2012.23030
dc.identifier.urihttp://hdl.handle.net/123456789/1014
dc.language.isoenen_US
dc.publisherScientific Research Publishingen_US
dc.subjectParallel Computingen_US
dc.subjectSurface-Based DNA Computersen_US
dc.subjectDominating Set Problemen_US
dc.subjectNP-Complete Problemen_US
dc.titleApplying Surface-Based DNA Computing for Solving the Dominating Set Problemen_US
dc.typeArticleen_US
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
Applying Surface-Based.pdf
Size:
366.93 KB
Format:
Adobe Portable Document Format
Description:
Full text
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description:
Download
Collections
Biology and Biotechnology