DNA Computing Model for Satisfiability Problem Based on Hybridization Chain Reaction

Satisfiability problem is a famous nondeterministic polynomial-time complete (NP-complete) problem, which has always been a hotspot in artificial intelligence. In this paper, by combining the advan...

[1]  C. Zhang,et al.  Entropy-driven DNA logic circuits regulated by DNAzyme , 2018, Nucleic acids research.

[2]  Clifford R. Johnson,et al.  Solution of a 20-Variable 3-SAT Problem on a DNA Computer , 2002, Science.

[3]  Jie Chao,et al.  Solving mazes with single-molecule DNA navigators , 2018, Nature Materials.

[4]  Grzegorz Rozenberg,et al.  DNA computing using single-molecule hybridization detection. , 2004, Nucleic acids research.

[5]  Shawn M. Douglas,et al.  DNA-nanotube-induced alignment of membrane proteins for NMR structure determination , 2007, Proceedings of the National Academy of Sciences.

[6]  Yuriy Brun.  Nondeterministic polynomial time factoring in the tile assembly model , 2008, Theor. Comput. Sci..

[7]  P. Rothemund.  Folding DNA to create nanoscale shapes and patterns , 2006, Nature.

[8]  Yuguo Tang,et al.  Hybridization chain reaction directed DNA superstructures assembly for biosensing applications , 2017 .

[9]  Reinhard Niessner,et al.  DNA-based hybridization chain reaction for amplified bioelectronic signal and ultrasensitive detection of proteins. , 2012, Analytical chemistry.

[10]  Jing Yang,et al.  Aptamer-Binding Directed DNA Origami Pattern for Logic Gates. , 2016, ACS applied materials & interfaces.

[11]  Y. Chai,et al.  In situ hybridization chain reaction amplification for universal and highly sensitive electrochemiluminescent detection of DNA. , 2012, Analytical chemistry.

[12]  Linqiang Pan,et al.  Logic nanoparticle beacon triggered by the binding-induced effect of multiple inputs. , 2014, ACS applied materials & interfaces.

[13]  Yuriy Brun.  Solving satisfiability in the tile assembly model with a constant-size tileset , 2008, J. Algorithms.

[14]  Mingdong Dong,et al.  DNA origami design of dolphin-shaped structures with flexible tails. , 2008, ACS nano.

[15]  Chang-Biau Yang,et al.  Solving satisfiability problems using a novel microarray-based DNA computer , 2007, Biosyst..

[16]  Kemin Wang,et al.  Pyrene-excimer probes based on the hybridization chain reaction for the detection of nucleic acids in complex biological fluids. , 2011, Angewandte Chemie.

[17]  Hao Yan,et al.  Scaffolded DNA origami of a DNA tetrahedron molecular container. , 2009, Nano letters.

[18]  Jin Xu,et al.  Plasmid Resolving the Satisfiability Problem with DNA Computing Models , 2007 .

[19]  Ying Wang,et al.  Analogic China map constructed by DNA , 2006 .

[20]  J. Kjems,et al.  Self-assembly of a nanoscale DNA box with a controllable lid , 2009, Nature.

[21]  Lloyd M. Smith,et al.  DNA computing on surfaces , 2000, Nature.

[22]  L. Pan,et al.  A study on a special DNA nanotube assembled from two single-stranded tiles , 2019, Nanotechnology.

[23]  L M Adleman,et al.  Molecular computation of solutions to combinatorial problems. , 1994, Science.

[24]  Xia Sun,et al.  Dynamically NAND gate system on DNA origami template , 2019, Comput. Biol. Medicine.

[25]  Hao Yan,et al.  Single-stranded DNA and RNA origami , 2017, Science.

[26]  Ali A. Abdulhameed,et al.  Development of gravitational search algorithm model for predicting packing density of cementitious pastes , 2020 .

[27]  Lulu Qian,et al.  Fractal assembly of micrometre-scale DNA origami arrays with arbitrary patterns , 2017, Nature.