{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,3]],"date-time":"2024-06-03T14:00:16Z","timestamp":1717423216100},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2008,12,10]],"date-time":"2008-12-10T00:00:00Z","timestamp":1228867200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Sign Process Syst Sign Image Video Technol"],"published-print":{"date-parts":[[2010,2]]},"DOI":"10.1007\/s11265-008-0322-3","type":"journal-article","created":{"date-parts":[[2008,12,9]],"date-time":"2008-12-09T13:48:46Z","timestamp":1228830526000},"page":"117-124","source":"Crossref","is-referenced-by-count":6,"title":["Bioinspired Parallel Algorithms for Maximum Clique Problem on FPGA Architectures"],"prefix":"10.1007","volume":"58","author":[{"given":"Israel","family":"Mart\u00ednez-P\u00e9rez","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wolfgang","family":"Brandt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Wild","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Karl-Heinz","family":"Zimmermann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,12,10]]},"reference":[{"key":"322_CR1","doi-asserted-by":"crossref","first-page":"1021","DOI":"10.1126\/science.7973651","volume":"266","author":"L. Adleman","year":"1994","unstructured":"Adleman, L. (1994). Molecular computation of solutions of combinatorial problems. Science 266, 1021\u20131023.","journal-title":"Science"},{"key":"322_CR2","volume-title":"Computers and intractability: A guide to the theory of NP-completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M. R., & Johnson D. S. (1979). Computers and intractability: A guide to the theory of NP-completeness. New York: W.H. Freeman."},{"key":"322_CR3","volume-title":"DNA computing models","author":"Z. Ignatova","year":"2008","unstructured":"Ignatova, Z., Martinez-Perez, I., & Zimmermann, K.-H. (2008). DNA computing models. Boston: Springer."},{"key":"322_CR4","doi-asserted-by":"crossref","DOI":"10.1002\/9780470127896","volume-title":"Advanced FPGA design: Architecture, implementation, and optimization","author":"S. Kilts","year":"2007","unstructured":"Kilts, S. (2007). Advanced FPGA design: Architecture, implementation, and optimization. New York: Wiley-IEEE."},{"key":"322_CR5","volume-title":"Encyclopedia of molecular biology","author":"J. Kendrew","year":"1998","unstructured":"Kendrew, J. (1998). Encyclopedia of molecular biology. Oxford: Blackwell."},{"key":"322_CR6","unstructured":"Martinez-Perez, I. (2007). Biomolecular computing models for graph problems and finite state automata. Ph.D. thesis, Hamburg Univ Tech."},{"key":"322_CR7","first-page":"1","volume-title":"DNA based computers","author":"S. Roweis","year":"1996","unstructured":"Roweis, S., Winfree, E., Burgoyne, R., Chelyapov, N., Goodman, M., Rothemund P., et al. (1996). A sticker based architecture for DNA computation. In E. B. Baum (Ed.), DNA based computers (pp. 1\u201327). Providence: AMS."},{"key":"322_CR8","unstructured":"XILINX (2008). Virtex-4 FPGA user guide. http:\/\/www.xilinx.com\/support\/documentation\/user_guides\/ug070.pdf ."},{"key":"322_CR9","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1109\/18.979325","volume":"48","author":"K.-H. Zimmermann","year":"2002","unstructured":"Zimmermann, K.-H. (2002). On applying molecular computation to binary linear codes. IEEE Transactions on Information Theory, 48, 505\u2013510.","journal-title":"IEEE Transactions on Information Theory"},{"key":"322_CR10","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1016\/S0010-4655(02)00270-9","volume":"114","author":"K.-H. Zimmermann","year":"2002","unstructured":"Zimmermann, K.-H. (2002). Efficient DNA sticker algorithms for NP-complete graph problems. Computer Physics Communications, 114, 297\u2013309.","journal-title":"Computer Physics Communications"}],"container-title":["Journal of Signal Processing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11265-008-0322-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11265-008-0322-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11265-008-0322-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T12:19:30Z","timestamp":1559391570000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11265-008-0322-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,12,10]]},"references-count":10,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2010,2]]}},"alternative-id":["322"],"URL":"https:\/\/doi.org\/10.1007\/s11265-008-0322-3","relation":{},"ISSN":["1939-8018","1939-8115"],"issn-type":[{"value":"1939-8018","type":"print"},{"value":"1939-8115","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,12,10]]}}}