{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,3,31]],"date-time":"2023-03-31T21:17:06Z","timestamp":1680297426449},"reference-count":9,"publisher":"World Scientific Pub Co Pte Lt","issue":"01","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2005,2]]},"abstract":"<jats:p> In recent works for high performance computing, computation with DNA molecules, that is, DNA computing, has been receiving considerable attention as an alternative for silicon based computers. In this paper, we propose two procedures for computing multiple input functions. We first propose a simple procedure for computing AND function. The procedure runs in O(1) steps using O(mn) DNA strands for n binary numbers of m bits. The procedure is also applicable to other simple logic functions, such as OR, NAND and NOR. We next propose a procedure for EX-OR function. The procedure runs in O(1) steps using O(mn<jats:sup>2<\/jats:sup>) DNA strands, and is also applicable to other functions, such as majority and threshold functions. <\/jats:p>","DOI":"10.1142\/s0129054105002851","type":"journal-article","created":{"date-parts":[[2005,3,14]],"date-time":"2005-03-14T08:00:11Z","timestamp":1110787211000},"page":"37-54","source":"Crossref","is-referenced-by-count":1,"title":["PROCEDURES FOR MULTIPLE INPUT FUNCTIONS WITH DNA MOLECULES"],"prefix":"10.1142","volume":"16","author":[{"given":"AKIHIRO","family":"FUJIWARA","sequence":"first","affiliation":[{"name":"Department of Computer Science  and Electronics, Kyushu Institute of Technology, 680-4 Kawazu,  Iizuka, Fukuoka 820-8502, Japan"}]},{"given":"SATOSHI","family":"KAMIO","sequence":"additional","affiliation":[{"name":"Department of Computer Science  and Electronics, Kyushu Institute of Technology, 680-4 Kawazu,  Iizuka, Fukuoka 820-8502, Japan"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"reference":[{"key":"rf1","doi-asserted-by":"publisher","DOI":"10.1038\/scientificamerican0898-54"},{"key":"rf3","first-page":"113","volume":"2","author":"Frisco P.","journal-title":"Romanian Journal of Information Science and Technology(ROMJIST)"},{"key":"rf4","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054104002546"},{"key":"rf5","doi-asserted-by":"publisher","DOI":"10.1126\/science.273.5272.220"},{"key":"rf9","doi-asserted-by":"publisher","DOI":"10.1126\/science.7725098"},{"key":"rf10","doi-asserted-by":"publisher","DOI":"10.1126\/science.278.5337.446"},{"key":"rf11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-03563-4"},{"key":"rf14","doi-asserted-by":"publisher","DOI":"10.1007\/PL00008272"},{"key":"rf15","first-page":"9","author":"Yoshida H.","journal-title":"American Mathematical Society"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054105002851","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T15:26:52Z","timestamp":1565191612000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054105002851"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,2]]},"references-count":9,"journal-issue":{"issue":"01","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[2005,2]]}},"alternative-id":["10.1142\/S0129054105002851"],"URL":"https:\/\/doi.org\/10.1142\/s0129054105002851","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,2]]}}}