Resolving the 3-Dimensional Matching Problem and the Set Packing Problem in Adleman-Lipton's Model

W.-L. Chang (Taiwan) and M. Guo (Japan)


Biological Computing, Molecular Computing, DNA-based Computing, the NP-complete Problem.


In this paper, it is demonstrated how the DNA (DeoxyriboNucleic Acid) operations proposed by Adleman and Lipton can be employed towards developing efficient DNA algorithms for determining the 3-dimensional matching problem and the set packing problem.

Important Links:

Go Back