Related Experiment Video
Updated: Aug 30, 2026

DNA-Tethered RNA Polymerase for Programmable In vitro Transcription and Molecular Computation
Published on: December 29, 2021
Solving the 3-SAT problem based on DNA computing
Wenbin Liu1, Lin Gao, Xiangrong Liu
1Department of Control Science and Engineering, Huazhong University of Science and Technology, Wuhan City 430074, China. wbliu@mail.hust.edu.cn
Abstract:
The 3-SAT problem is an NP-complete problem, and many algorithms based on DNA computing have been proposed for solving it since Adleman's pioneering work. This paper presents a new algorithm based on the literal string strategy proposed by Sakamoto et al. Simulation results show that the maximal number of literal strings produced during the computing process is greatly reduced. Moreover, the length of the literal strings is also reduced from m to n at most.
Related Concept Videos
DNA as a Genetic Template
DNA as a Genetic Template
The DNA Helix
The DNA Helix
Biot-Savart Law: Problem-Solving
Consider a mobile phone battery bank as a source of steady current, which flows through the wire connected between the two. What is the magnitude of the magnetic field created by this current at a field point P?
To estimate the magnitude of the total magnetic field, we first consider a small current element of length dl, at a distance r from the field point. Now the following...
DNA Topoisomerases
Types and Mechanism of action
Topoisomerases are divided into two main types. Type I...
