Related Experiment Video
Updated: Aug 25, 2026

DNA-Tethered RNA Polymerase for Programmable In vitro Transcription and Molecular Computation
Published on: December 29, 2021
Molecular solutions for the subset-sum problem on DNA-based supercomputing
Weng-Long Chang1, Michael Shan-Hui Ho, Minyi Guo
1Department of Information Management, Southern Taiwan University of Technology, Tainan County 710, Taiwan, ROC. changwl@mail.stut.edu.tw
Abstract:
In this paper our main purpose is to give molecular solutions for the subset-sum problem. In order to achieve this, we propose a DNA-based algorithm of an n-bit parallel adder and a DNA-based algorithm of an n-bit parallel comparator to formally verify our designed molecular solutions for the subset-sum problem.
Related Concept Videos
Modern Molecular Taxonomy
DNA Microarrays
Maxam-Gilbert Sequencing
Challenges of the Maxam-Gilbert Method
The...
DNA Isolation
DNA Isolation
Sanger Sequencing
