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