String Tile Models for DNA Computing by Self-Assembly
DNA '00 Revised Papers from the 6th International Workshop on DNA-Based Computers: DNA Computing
DNA8 Revised Papers from the 8th International Workshop on DNA Based Computers: DNA Computing
DNA Implementation of Theorem Proving with Resolution Refutation in Propositional Logic
DNA8 Revised Papers from the 8th International Workshop on DNA Based Computers: DNA Computing
Natural Computing: an international journal
Autonomous resolution based on DNA strand displacement
DNA'11 Proceedings of the 17th international conference on DNA computing and molecular programming
| Hi-index | 0.00 |
Kobayashi proposed Horn clause computation by DNA molecules, which is more suitable for expressing complex algorithms than other models for DNA computing. This paper describes a new implementation of Horn clause computation by DNA. It employs branching DNA molecules for representing Horn clauses. As derivations are realized by self-assembly of such molecules, the implementation requires only a constant number of laboratory operations. Furthermore, it deals with firstorder Horn clauses with some restrictions. In order to realize first-order logic, we implement variable substitutions by string tiling proposed by Winfree, et al. As we show the computational power of a Horn clause program in our model, we give another proof that a polynomial number of operations using self-assembly of DNA molecules can compute any problem in NP.