{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T21:50:09Z","timestamp":1649022609336},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2014,6,28]],"date-time":"2014-06-28T00:00:00Z","timestamp":1403913600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2014,8]]},"DOI":"10.1007\/s11227-014-1222-x","type":"journal-article","created":{"date-parts":[[2014,6,27]],"date-time":"2014-06-27T01:27:04Z","timestamp":1403832424000},"page":"976-1005","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Molecular solutions for minimum and exact cover problems in the tile assembly model"],"prefix":"10.1007","volume":"69","author":[{"given":"Xu","family":"Zhou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"YanTao","family":"Zhou","sequence":"additional","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":"Keqin","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,6,28]]},"reference":[{"key":"1222_CR1","doi-asserted-by":"crossref","unstructured":"Chang WL, Lin KW, Chen JC et al (2012) Molecular solutions of the RSA public-key cryptosystem on a DNA-based computer. J Supercomput 61(3):642\u2013672","DOI":"10.1007\/s11227-011-0627-z"},{"issue":"1","key":"1222_CR2","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1109\/TNB.2011.2167757","volume":"11","author":"WL Chang","year":"2012","unstructured":"Chang WL (2012) Fast parallel DNA-based algorithm for molecular computation: quadratic congruence and factoring integers. IEEE Trans Nanobiosci 11(1):62\u201369","journal-title":"IEEE Trans Nanobiosci"},{"key":"1222_CR3","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/s11227-009-0347-9","volume":"56","author":"WL Chang","year":"2011","unstructured":"Chang WL, Huang SC, Lin WC et al (2011) Fast parallel DNA-based algorithms for molecular computation: discrete logarithm. J Supercomput 56:129\u2013163","journal-title":"J Supercomput"},{"issue":"2","key":"1222_CR4","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1109\/TNB.2011.2160996","volume":"10","author":"X Jin","year":"2011","unstructured":"Jin X, Xiaoli Q, Yan Y et al (2011) An unenumerative DNA computing model for vertex coloring problem. IEEE Trans Nanobiosci 10(2):94\u201398","journal-title":"IEEE Trans Nanobiosci"},{"key":"1222_CR5","doi-asserted-by":"crossref","unstructured":"Li K, Zou S, Xu J (2008) Fast parallel molecular algorithms for DNA-based computation: solving the elliptic curve discrete logarithm problem over GF(2n). J Biomed Biotechnol 1:1\u201310","DOI":"10.1155\/2008\/518093"},{"issue":"1","key":"1222_CR6","first-page":"347","volume":"66","author":"Xu Zhou","year":"2011","unstructured":"Zhou Xu, Li Kenli et al (2011) A novel approach for the classical Ramsey number problem on DNA-based super-computing. Match Commun Math Comput Chem 66(1):347\u2013370","journal-title":"Match Commun Math Comput Chem"},{"issue":"51","key":"1222_CR7","doi-asserted-by":"crossref","first-page":"7075","DOI":"10.1016\/j.tcs.2011.09.004","volume":"412","author":"M Daniel","year":"2011","unstructured":"Daniel M, Alfonso R-P, Petr S (2011) On the scalability of biocomputing algorithms: the case of the maximum clique problem. Theor Comput Sci 412(51):7075\u20137086","journal-title":"Theor Comput Sci"},{"issue":"1","key":"1222_CR8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.biosystems.2007.06.002","volume":"91","author":"RAB Bakar","year":"2008","unstructured":"Bakar RAB, Watada J, Pedrycz W (2008) DNA approach to solve clustering problem based on a mutual order. Biosystems 91(1):1\u201312","journal-title":"Biosystems"},{"issue":"2","key":"1222_CR9","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1109\/TNB.2012.2190618","volume":"11","author":"K Ikno","year":"2012","unstructured":"Ikno K, Junzo W, Wutikd P et al (2012) Pattern clustering with statistical methods using a DNA-based algorithm. IEEE Trans Nanobiosci 11(2):100\u2013110","journal-title":"IEEE Trans Nanobiosci"},{"issue":"2","key":"1222_CR10","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1109\/TNB.2009.2023788","volume":"8","author":"K Ikno","year":"2009","unstructured":"Ikno K, Junzo W (2009) Decision making with an interpretive structural modeling method using a DNA-based algorithm. IEEE Trans Nanobiosci 8(2):181\u2013191","journal-title":"IEEE Trans Nanobiosci"},{"issue":"8","key":"1222_CR11","first-page":"1223","volume":"394","author":"E Winfree","year":"1998","unstructured":"Winfree E (1998) Design and self-assembly of two-dimensional DNA crystals. Nature 394(8):1223\u20131226","journal-title":"Nature"},{"key":"1222_CR12","doi-asserted-by":"crossref","unstructured":"Adleman LM, Cheng Q, Goel A et al (2001) Running time and program size for self-assembled squares. In: Proceedings of the thirty-third annual ACM symposium on theory of computing, STOC 2001, Hersonissos, Greece. ACM, pp 740\u2013748","DOI":"10.1145\/380752.380881"},{"key":"1222_CR13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s00453-011-9522-5","volume":"63","author":"S Summers","year":"2012","unstructured":"Summers S (2012) Reducing tile complexity for the self-assembly of scaled shapes through temperature programming. Algorithmica 63:1\u201320","journal-title":"Algorithmica"},{"key":"1222_CR14","doi-asserted-by":"crossref","unstructured":"Woods D, Chen HL, Goodfriend S et al (2013) Active self-assembly of algorithmic shapes and patterns in polylogarithmic time. In: Innovations in theoretical computer science, ITCS 2013, Berkeley, California, January 10\u201312","DOI":"10.1145\/2422436.2422476"},{"key":"1222_CR15","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/j.tcs.2006.10.025","volume":"378","author":"Y Brun","year":"2006","unstructured":"Brun Y (2006) Arithmetic computation in the tile assembly model: addition and multiplication. Theor Comput Sci 378:17\u201331","journal-title":"Theor Comput Sci"},{"issue":"1","key":"1222_CR16","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":"1222_CR17","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/j.tcs.2007.07.051","volume":"395","author":"Y Brun","year":"2008","unstructured":"Brun Y (2008) Nondeterministic polynomial time factoring in the tile assembly model. Theor Comput Sci 395(1):3\u201323","journal-title":"Theor Comput Sci"},{"issue":"4","key":"1222_CR18","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/j.jalgor.2008.07.002","volume":"63","author":"Y Brun","year":"2008","unstructured":"Brun Y (2008) Solving satisfiability in the tile assembly model with a constant-size tile set. J Algorithms 63(4):151\u2013166","journal-title":"J Algorithms"},{"issue":"5","key":"1222_CR19","doi-asserted-by":"crossref","first-page":"1067","DOI":"10.1166\/jctn.2009.1146","volume":"6","author":"XC Zhang","year":"2009","unstructured":"Zhang XC, Niu Y et al (2009) Application of DNA self-assembly on graph coloring problem. J Comput Theor Nanosci 6(5):1067\u20131074","journal-title":"J Comput Theor Nanosci"},{"issue":"5","key":"1222_CR20","doi-asserted-by":"crossref","first-page":"1161","DOI":"10.1166\/jctn.2009.1160","volume":"6","author":"Z Cheng","year":"2009","unstructured":"Cheng Z, Huang YF et al (2009) Algorithm of solving the subset-product problem based on DNA tile self-assembly. J Comput Theor Nanosci 6(5):1161\u20131169","journal-title":"J Comput Theor Nanosci"},{"key":"1222_CR21","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1007\/978-3-642-03156-4_36","volume":"116","author":"C Guangzhao","year":"2009","unstructured":"Guangzhao C, Cuiling L et al (2009) Application of DNA self-assembly on maximum clique problem. Adv Intell Soft Comput 116:359\u2013368","journal-title":"Adv Intell Soft Comput"},{"issue":"1","key":"1222_CR22","first-page":"153","volume":"5","author":"L Jie","year":"2008","unstructured":"Jie L, Lei Y, Kenli L (2008) An $$O$$ O (1.414 $$^{n})$$ n ) volume molecular solutions for the exact cover problem on DNA-based supercomputing. J Inf Comput Sci 5(1):153\u2013162","journal-title":"J Inf Comput Sci"},{"issue":"2","key":"1222_CR23","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/S0303-2647(03)00149-7","volume":"72","author":"WL Chang","year":"2003","unstructured":"Chang WL, Guo M (2003) Solving the set-cover problem and the problem of exact cover by 3-sets in the Adleman\u2013Lipton model. BioSystems 72(2):263\u2013275","journal-title":"BioSystems"},{"key":"1222_CR24","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1007\/s11227-013-0892-0","volume":"66","author":"Wu Fan","year":"2013","unstructured":"Fan Wu, Li Kenli, Sallam Ahmed et al (2013) A molecular solution for minimum vertex cover problem in tile assembly model. J Supercomput 66:148\u2013169","journal-title":"J Supercomput"},{"key":"1222_CR25","unstructured":"Winfree E The xgrow simulator. http:\/\/dna.caltech.edu\/Xgrow\/"},{"issue":"3","key":"1222_CR26","doi-asserted-by":"crossref","first-page":"1016","DOI":"10.1109\/TIE.2010.2048291","volume":"58","author":"CC Tsai","year":"2011","unstructured":"Tsai CC, Huang HC, Lin SC (2011) FPGA-based parallel DNA algorithm for optimal configurations of an omnidirectional mobile service robot performing fire extinguishment. IEEE Trans Ind Electron 58(3):1016\u20131026","journal-title":"IEEE Trans Ind Electron"},{"key":"1222_CR27","doi-asserted-by":"crossref","first-page":"368","DOI":"10.1038\/nature10262","volume":"475","author":"Q Lulu","year":"2011","unstructured":"Lulu Q, Erik W, Bruck J (2011) Neural network computation with DNA strand displacement cascades. Nature 475:368\u2013372","journal-title":"Nature"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-014-1222-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11227-014-1222-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-014-1222-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,11]],"date-time":"2019-08-11T19:42:57Z","timestamp":1565552577000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11227-014-1222-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,6,28]]},"references-count":27,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2014,8]]}},"alternative-id":["1222"],"URL":"https:\/\/doi.org\/10.1007\/s11227-014-1222-x","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,6,28]]}}}