Abstract
DNA origami is widely used in DNA computing by its programmability and nano-addressability. This study presents the solution for the satisfiability (SAT) problem utilizing DNA strand displacement and origami DNA: firstly, map all the solutions of the SAT problem to the origami base; secondly, add the initiator chain to make it fully react; finally, determine the feasible solution by whether there is fluorescence on the DNA origami base, so as to search for the final solution. And through a specific case, we verify the feasibility of the model.
Export citation and abstract BibTeX RIS
Content from this work may be used under the terms of the Creative Commons Attribution 3.0 licence. Any further distribution of this work must maintain attribution to the author(s) and the title of the work, journal citation and DOI.