Abstract
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 first-order 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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Satoshi Kobayashi et al.: DNA Implementation of Simple Horn Clause Computation, IEEE International Conference on Evolutionary Computation, pp. 213–217, 1997.
Satoshi Kobayashi: Horn Clause Computation with DNA Molecules, Journal of Combinatorial Optimization, Vol. 3, pp. 277–299, 1999.
Stuart A. Kurtz et al.: Active Transport in Biological Computing, DNA Based Computers II, DIMACS Series, Vol. 44, pp. 171–179, 1998.
Thomas H. LaBean et al.: Experimental Progress in Computation by Self-Assembly of DNA Tilings, Preliminary Proc. of Fifth International Meeting on DNA Based Computers, pp. 121–138, 1999.
Nadrian C. Seeman et al.: The Perils of Polynucleotides: The Experimental Gap Between The Design and Assembly of Unusual DNA Structures, DNA Based Computers II, DIMACS Series, Vol. 44, pp. 215–233, 1998.
Piotr Wcasiewicz et al.: The Inference via DNA Computing, Congress on Evolutionary Computation (CEC’99), pp. 988–993, 1999.
Piotr Wcasiewicz et al.: The Inference Based on Molecular Computing, Int. Journal of Cybernetics and Systems, 31/3, pp. 283–315, 2000.
Erik Winfree: Simulations of Computing by Self-Assembly, Preliminary Proc. of Fourth International Meeting on DNA Based Computers, pp. 213–239, 1998.
Erik Winfree et al.: String Tile Models for DNA Computing by Self-Assembly, Preliminary Proc. of Sixth International Meeting on DNA Based Computers, pp. 65–84, 2000.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Uejima, H., Hagiya, M., Kobayashi, S. (2002). Horn Clause Computation by Self-assembly of DNA Molecules. In: Jonoska, N., Seeman, N.C. (eds) DNA Computing. DNA 2001. Lecture Notes in Computer Science, vol 2340. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48017-X_29
Download citation
DOI: https://doi.org/10.1007/3-540-48017-X_29
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43775-8
Online ISBN: 978-3-540-48017-4
eBook Packages: Springer Book Archive