DNA implementation of simple horn clause computation

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

研究成果: Paper査読

8 被引用数 (Scopus)

抄録

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.'

本文言語English
ページ213-217
ページ数5
出版ステータスPublished - 1997 1 1
外部発表はい
イベントProceedings of the 1997 IEEE International Conference on Evolutionary Computation, ICEC'97 - Indianapolis, IN, USA
継続期間: 1997 4 131997 4 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)

フィンガープリント 「DNA implementation of simple horn clause computation」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル