DocumentCode
1870424
Title
DNA implementation of simple Horn clause computation
Author
Kobayashi, Satoshi ; Yokomori, Takashi ; Sampei, Geri-ichi ; Mizobuchi, Kiyoshi
Author_Institution
Dept. of Comput. Sci. & Inf. Math., Univ. of Electro-Commun., Tokyo, Japan
fYear
1997
fDate
13-16 Apr 1997
Firstpage
213
Lastpage
217
Abstract
In this paper, we propose a method for biologically implementing simple Boolean formulae. This method enables us to compute the logical consequences of a given set of simple Horn clauses in parallel and takes advantage of the potentially huge number of molecular CPUs in DNA computers. Further, we show that the method can be nicely applied to the parallel implementation of a grammatical recognition algorithm which is based on `dynamic programming´
Keywords
Boolean algebra; DNA; Horn clauses; biocomputers; dynamic programming; grammars; parallel processing; pattern recognition; Boolean formulae; DNA computers; Horn clause computation; biological implementation; dynamic programming; grammatical recognition algorithm; logical consequences; molecular CPUs; parallel implementation; Biological system modeling; Biology computing; Chemistry; Computational modeling; Computer science; Concurrent computing; DNA computing; Logic testing; Mathematics; Physics;
fLanguage
English
Publisher
ieee
Conference_Titel
Evolutionary Computation, 1997., IEEE International Conference on
Conference_Location
Indianapolis, IN
Print_ISBN
0-7803-3949-5
Type
conf
DOI
10.1109/ICEC.1997.592298
Filename
592298
Link To Document