Fast parallel DNA-based algorithms for molecular computation: the set-partition problem
Related Experiment Video
Updated: Jul 8, 2026

DNA-Tethered RNA Polymerase for Programmable In vitro Transcription and Molecular Computation
Published on: December 29, 2021
1Department of Computer Science and Information Engineering, National Kaohsiung University of Applied Sciences, Kaohsiung 807, Taiwan, R.O.C. changwl@cc.kuas.edu.tw
Abstract:
This paper demonstrates that basic biological operations can be used to solve the set-partition problem. In order to achieve this, we propose three DNA-based algorithms, a signed parallel adder, a signed parallel subtractor and a signed parallel comparator, that formally verify our designed molecular solutions for solving the set-partition problem.
Related Concept Videos
Modern Molecular Taxonomy
DNA Isolation
Maxam-Gilbert Sequencing
Challenges of the Maxam-Gilbert Method
The...
Next-generation Sequencing
Next-Generation Sequencing Methods
Although all next-generation methods use different technologies, they all share a set of standard features.
Sanger Sequencing
Applications of Molecular Taxonomy
