AIRCC's International Journal of Computer Science and Information Technology

The PDF file you selected should load here if your Web browser has a PDF reader plug-in installed (for example, a recent version of Adobe Acrobat Reader).

If you would like more information about how to print, save, and work with PDFs, Highwire Press provides a helpful Frequently Asked Questions about PDFs.

Alternatively, you can download the PDF file directly to your computer, from where it can be opened using a PDF reader. To download the PDF, click the Download link above.

Fullscreen Fullscreen Off


Consider that the every element in a finite set S having q elements is a positive integer. The set-partition problem is to determine whether there is a subset T ⊆ S such that , ∑XX∈T = ∑XX∈̅T where ̅T = {xl x ∈ S and x ∉ T}. This research demonstrates that molecular operations can be applied to solve the set-partition problem. In order to perform this goal, we offer two DNA-based algorithms, an unsigned parallel adder and a parallel Exclusive-OR (XOR) operation, that formally demonstrate our designed molecular solutions for solving the set-partition problem.

Keywords

DNA-Based Computing, The Set-Partition Problem, the NP-Complete Problems, the NP-Hard Problems.
User
Notifications
Font Size