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 |
|---|---|
| Title of host publication | Proceedings of the IEEE Conference on Evolutionary Computation, ICEC |
| Editors | Anon |
| Place of Publication | Piscataway, NJ, United States |
| Publisher | IEEE |
| Pages | 213-217 |
| Number of pages | 5 |
| Publication status | Published - 1997 |
| 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 |
Fingerprint
ASJC Scopus subject areas
- Computer Science(all)
- Engineering(all)
Cite this
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 proceeding › Conference contribution
}
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 -