DNA implementation of simple horn clause computation

Satoshi Kobayashi, Takashi Yokomori, Gen ichi Sampei, Kiyoshi Mizobuchi

Research output: Contribution to conferencePaper

8 Citations (Scopus)

Abstract

In this paper, we propose a method for biologically implementing simple Boolean formulae. This method enables us to compute logical consequences of a given set of simple Horn clauses in parallel and takes advantage of potentially huge number of molecular CPUs of DNA computers. Further, we show that the method is nicely applied to the parallel implementation of a grammatical recognition algorithm which is based on `dynamic programming.'

Original languageEnglish
Pages213-217
Number of pages5
Publication statusPublished - 1997 Jan 1
EventProceedings of the 1997 IEEE International Conference on Evolutionary Computation, ICEC'97 - Indianapolis, IN, USA
Duration: 1997 Apr 131997 Apr 16

Other

OtherProceedings of the 1997 IEEE International Conference on Evolutionary Computation, ICEC'97
CityIndianapolis, IN, USA
Period97/4/1397/4/16

ASJC Scopus subject areas

  • Computer Science(all)
  • Engineering(all)

Fingerprint Dive into the research topics of 'DNA implementation of simple horn clause computation'. Together they form a unique fingerprint.

  • Cite this

    Kobayashi, S., Yokomori, T., Sampei, G. I., & Mizobuchi, K. (1997). DNA implementation of simple horn clause computation. 213-217. Paper presented at Proceedings of the 1997 IEEE International Conference on Evolutionary Computation, ICEC'97, Indianapolis, IN, USA, .