Related Experiment Video
Updated: Aug 4, 2026

Selecting Multiple Biomarker Subsets with Similarly Effective Binary Classification Performances
Published on: October 11, 2018
Solving the set cover problem and the problem of exact cover by 3-sets in the Adleman-Lipton model
1Department of Information Management, Southern Taiwan University of Technology, 701 ROC, Tainan, Taiwan. changwl@csie.ncku.edu.tw
Abstract:
Adleman wrote the first paper in which it is shown that deoxyribonucleic acid (DNA) strands could be employed towards calculating solutions to an instance of the NP-complete Hamiltonian path problem (HPP). Lipton also demonstrated that Adleman's techniques could be used to solve the NP-complete satisfiability (SAT) problem (the first NP-complete problem). In this paper, it is proved how the DNA operations presented by Adleman and Lipton can be used for developing DNA algorithms to resolving the set cover problem and the problem of exact cover by 3-sets.
Related Concept Videos
Theorems of Pappus and Guldinus: Problem Solving
Castigliano's Theorem: Problem Solving
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...
Mathematical Modeling: Problem Solving
Gaussian Elimination: Problem Solving
Lagrange Multipliers: Two Constraints

