DNA implementation of simple horn clause computation

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

DNA implementation of simple horn clause computation

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

Research output: Contribution to conference › Paper › peer-review

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 language	English
Pages	213-217
Number of pages	5
Publication status	Published - 1997 Jan 1
Externally published	Yes
Event	Proceedings of the 1997 IEEE International Conference on Evolutionary Computation, ICEC'97 - Indianapolis, IN, USA Duration: 1997 Apr 13 → 1997 Apr 16

Other

Other	Proceedings of the 1997 IEEE International Conference on Evolutionary Computation, ICEC'97
City	Indianapolis, IN, USA
Period	97/4/13 → 97/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

@conference{182ca039fcd342909c214d219b9dc156,

title = "DNA implementation of simple horn clause computation",

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

author = "Satoshi Kobayashi and Takashi Yokomori and Sampei, {Gen ichi} and Kiyoshi Mizobuchi",

year = "1997",

month = jan,

day = "1",

language = "English",

pages = "213--217",

note = "Proceedings of the 1997 IEEE International Conference on Evolutionary Computation, ICEC'97 ; Conference date: 13-04-1997 Through 16-04-1997",

}

TY - CONF

T1 - DNA implementation of simple horn clause computation

AU - Kobayashi, Satoshi

AU - Yokomori, Takashi

AU - Sampei, Gen ichi

AU - Mizobuchi, Kiyoshi

PY - 1997/1/1

Y1 - 1997/1/1

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

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

UR - http://www.scopus.com/inward/record.url?scp=0030654707&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0030654707&partnerID=8YFLogxK

M3 - Paper

AN - SCOPUS:0030654707

SP - 213

EP - 217

T2 - Proceedings of the 1997 IEEE International Conference on Evolutionary Computation, ICEC'97

Y2 - 13 April 1997 through 16 April 1997

ER -