{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T13:53:52Z","timestamp":1710251632558},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2013,3,16]],"date-time":"2013-03-16T00:00:00Z","timestamp":1363392000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2013,10]]},"DOI":"10.1007\/s11227-013-0892-0","type":"journal-article","created":{"date-parts":[[2013,3,16]],"date-time":"2013-03-16T04:39:38Z","timestamp":1363408778000},"page":"148-169","source":"Crossref","is-referenced-by-count":6,"title":["A molecular solution for minimum vertex cover problem in tile assembly model"],"prefix":"10.1007","volume":"66","author":[{"given":"Fan","family":"Wu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kenli","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ahmed","family":"Sallam","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xu","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,3,16]]},"reference":[{"key":"892_CR1","first-page":"282","volume-title":"Miniaturization","author":"RP Feynman","year":"1961","unstructured":"Feynman RP (1961) There\u2019s plenty of room at the bottom. In: Gilbert HD (ed) Miniaturization. Reinhold, New York, pp 282\u2013296"},{"key":"892_CR2","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/S0303-2647(00)00091-5","volume":"57","author":"T Head","year":"2000","unstructured":"Head T, Rozenberg G, Bladergroen RB et al (2000) Computing with DNA by operating on plasmids. BioSystems 57:87\u201393","journal-title":"BioSystems"},{"issue":"4","key":"892_CR3","doi-asserted-by":"crossref","first-page":"542","DOI":"10.1126\/science.7725098","volume":"268","author":"RJ Lipton","year":"1995","unstructured":"Lipton RJ (1995) DNA solution of hard computational problem. Science 268(4):542\u2013545","journal-title":"Science"},{"issue":"6","key":"892_CR4","first-page":"881","volume":"30","author":"J Xu","year":"2007","unstructured":"Xu J, Tan G, Fan Y et al (2007) DNA computer principle, advances and difficulties (IV): on the models of DNA computer [J]. Chin J Comput 30(6):881\u2013893","journal-title":"Chin J Comput"},{"key":"892_CR5","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1038\/28998","volume":"394","author":"E Winfree","year":"1998","unstructured":"Winfree E et al (1998) Design and self-assembly of two-dimensional DNA crystals. Nature 394:539\u2013544","journal-title":"Nature"},{"key":"892_CR6","doi-asserted-by":"crossref","first-page":"3211","DOI":"10.1021\/bi00064a003","volume":"32","author":"TJ Fu","year":"1993","unstructured":"Fu TJ, Seeman NC (1993) DNA double crossover molecules. Biochemistry 32:3211\u20133220","journal-title":"Biochemistry"},{"key":"892_CR7","volume-title":"Algorithmic self-assembly of DNA [D]","author":"E Winfree","year":"1998","unstructured":"Winfree E (1998) Algorithmic self-assembly of DNA [D]. California Institute of Technology, Pasadena, California"},{"key":"892_CR8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/3-540-45465-9_1","volume-title":"Proceedings of the twenty-ninth international colloquium on automata, languages and programming","author":"JH Reif","year":"2002","unstructured":"Reif JH (2002) Molecular assembly and computation: from theory to experimental demonstrations. In: Proceedings of the twenty-ninth international colloquium on automata, languages and programming, pp 1\u201321"},{"issue":"3","key":"892_CR9","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/BF01418780","volume":"12","author":"RM Robinson","year":"1971","unstructured":"Robinson RM (1971) Undecidability and nonperiodicity for tilings of the plane. Invent Math 12(3):177\u2013209","journal-title":"Invent Math"},{"issue":"1","key":"892_CR10","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1166\/asl.2011.1178","volume":"4","author":"Y Wang","year":"2011","unstructured":"Wang Y, Hu P, Zhang X et al (2011) DNA self-assembly for the minimum vertex cover problem. Adv Sci Lett 4(1):74\u201379(6)","journal-title":"Adv Sci Lett"},{"key":"892_CR11","first-page":"23","volume-title":"Proceedings of the symposium in the mathematical theory of automata","author":"H Wang","year":"1962","unstructured":"Wang H (1962) Dominoes and the AEA case of the decision problem. In: Proceedings of the symposium in the mathematical theory of automata, Brooklyn. Polytechnic Press, New York, pp 23\u201355"},{"key":"892_CR12","author":"W-L Chang","year":"2012","unstructured":"Chang W-L, Lin KWC, Chen J-C et al (2012) Molecular solutions of the RSA public-key cryptosystem on a DNA-based computer. J Supercomput. doi: 10.1007\/s11227-011-0627-z","journal-title":"J Supercomput"},{"key":"892_CR13","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1016\/j.biosystems.2005.06.009","volume":"82","author":"D Xiao","year":"2005","unstructured":"Xiao D, Li W, Zhang Z, He L (2005) Solving maximum cut problems in the Adleman\u2013Lipton model. BioSystems 82:203\u2013207","journal-title":"BioSystems"},{"key":"892_CR14","volume-title":"Proceedings of the 2008 international conference on foundations of computer science, FCS 2008","author":"A Dolati","year":"2008","unstructured":"Dolati A, Haghighat MS, Safaei S, Mozaffar H (2008) Solving minimum beta-vertex separator problems in the Adleman\u2013Lipton model. In: Proceedings of the 2008 international conference on foundations of computer science, FCS 2008, July 14\u201317, 2008, Las Vegas, Nevada, USA"},{"key":"892_CR15","unstructured":"Winfree E The Xgrow simulator. http:\/\/dna.caltech.edu\/Xgrow\/"},{"key":"892_CR16","first-page":"898","volume-title":"Proceedings of DATE","author":"S Garcia","year":"2009","unstructured":"Garcia S, Orailoglu A (2009) Making DNA self-assembly error-proof: attaining small growth error rates through embedded information redundancy. In: Proceedings of DATE, pp 898\u2013901"},{"issue":"11","key":"892_CR17","doi-asserted-by":"crossref","first-page":"1021","DOI":"10.1126\/science.7973651","volume":"266","author":"LM Adleman","year":"1994","unstructured":"Adleman LM (1994) Molecular computation of solutions to combinatorial problems. Science 266(11):1021\u20131023","journal-title":"Science"},{"issue":"1","key":"892_CR18","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/j.tcs.2007.07.052","volume":"395","author":"Y Brun","year":"2008","unstructured":"Brun Y (2008) Solving NP-complete problems in the tile assembly model. Theor Comput Sci 395(1):31\u201346","journal-title":"Theor Comput Sci"},{"issue":"1","key":"892_CR19","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/j.tcs.2006.10.025","volume":"378","author":"Y Brun","year":"2008","unstructured":"Brun Y (2008) Arithmetic computation in the tile assembly model: addition and multiplication. Theor Comput Sci 378(1):17\u201331","journal-title":"Theor Comput Sci"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-013-0892-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11227-013-0892-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-013-0892-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T10:24:09Z","timestamp":1559384649000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11227-013-0892-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,3,16]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2013,10]]}},"alternative-id":["892"],"URL":"https:\/\/doi.org\/10.1007\/s11227-013-0892-0","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,3,16]]}}}