The DNA Helix
DNA Packaging
Evolutionary Relationships through Genome Comparisons
DNA as a Genetic Template
Biot-Savart Law: Problem-Solving
Applications of Molecular Taxonomy
You might also read
Articles linked to this work by shared authors, journal, and citation graph.
Updated: Jul 18, 2025

DNA-Tethered RNA Polymerase for Programmable In vitro Transcription and Molecular Computation
Published on: December 29, 2021
DNA computing, using the Adleman-Lipton model, effectively solves the Prize Collecting Traveling Salesman Problem (PCTSP). This DNA computing approach yielded superior results compared to other algorithms for all tested PCTSP instances.
Area of Science:
Background:
Purpose of the Study:
Main Methods:
Main Results:
Conclusions: