Fast parallel molecular solution to the dominating-set problem on massively parallel bio-computing
This paper shows how to use DNA strands to construct solution space of molecules for the dominating-set problem and how to apply biological operations to solve the problem from the solution space of molecules. In order to achieve this, we have proposed some DNA based parallel algorithms using the operations in AdlemanLipton model, together with the analysis of the computational complexity for DNA parallel algorithms.
dominating-set problem dna based parallel algorithms parallel biological computing dna-based computing np-complete problem