DNA implementation of simple horn clause computation

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

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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
Title of host publicationProceedings of the IEEE Conference on Evolutionary Computation, ICEC
Editors Anon
Place of PublicationPiscataway, NJ, United States
PublisherIEEE
Pages213-217
Number of pages5
Publication statusPublished - 1997
Externally publishedYes
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

Fingerprint

Dynamic programming
Program processors
DNA

ASJC Scopus subject areas

  • Computer Science(all)
  • Engineering(all)

Cite this

Kobayashi, S., Yokomori, T., Sampei, G. I., & Mizobuchi, K. (1997). DNA implementation of simple horn clause computation. In Anon (Ed.), Proceedings of the IEEE Conference on Evolutionary Computation, ICEC (pp. 213-217). Piscataway, NJ, United States: IEEE.

DNA implementation of simple horn clause computation. / Kobayashi, Satoshi; Yokomori, Takashi; Sampei, Gen ichi; Mizobuchi, Kiyoshi.

Proceedings of the IEEE Conference on Evolutionary Computation, ICEC. ed. / Anon. Piscataway, NJ, United States : IEEE, 1997. p. 213-217.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Kobayashi, S, Yokomori, T, Sampei, GI & Mizobuchi, K 1997, DNA implementation of simple horn clause computation. in Anon (ed.), Proceedings of the IEEE Conference on Evolutionary Computation, ICEC. IEEE, Piscataway, NJ, United States, pp. 213-217, Proceedings of the 1997 IEEE International Conference on Evolutionary Computation, ICEC'97, Indianapolis, IN, USA, 97/4/13.
Kobayashi S, Yokomori T, Sampei GI, Mizobuchi K. DNA implementation of simple horn clause computation. In Anon, editor, Proceedings of the IEEE Conference on Evolutionary Computation, ICEC. Piscataway, NJ, United States: IEEE. 1997. p. 213-217
Kobayashi, Satoshi ; Yokomori, Takashi ; Sampei, Gen ichi ; Mizobuchi, Kiyoshi. / DNA implementation of simple horn clause computation. Proceedings of the IEEE Conference on Evolutionary Computation, ICEC. editor / Anon. Piscataway, NJ, United States : IEEE, 1997. pp. 213-217
@inproceedings{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",
language = "English",
pages = "213--217",
editor = "Anon",
booktitle = "Proceedings of the IEEE Conference on Evolutionary Computation, ICEC",
publisher = "IEEE",

}

TY - GEN

T1 - DNA implementation of simple horn clause computation

AU - Kobayashi, Satoshi

AU - Yokomori, Takashi

AU - Sampei, Gen ichi

AU - Mizobuchi, Kiyoshi

PY - 1997

Y1 - 1997

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 - Conference contribution

AN - SCOPUS:0030654707

SP - 213

EP - 217

BT - Proceedings of the IEEE Conference on Evolutionary Computation, ICEC

A2 - Anon, null

PB - IEEE

CY - Piscataway, NJ, United States

ER -