{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T18:56:24Z","timestamp":1743015384599,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":21,"publisher":"Springer Singapore","isbn-type":[{"type":"print","value":"9789811322051"},{"type":"electronic","value":"9789811322068"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-981-13-2206-8_22","type":"book-chapter","created":{"date-parts":[[2018,9,8]],"date-time":"2018-09-08T10:43:21Z","timestamp":1536403401000},"page":"250-262","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["The Algorithms of Weightening Based on DNA Sticker Model"],"prefix":"10.1007","author":[{"given":"Chunyan","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Weijun","family":"Zhu","sequence":"additional","affiliation":[]},{"given":"Qinglei","family":"Zhou","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,9,9]]},"reference":[{"key":"22_CR1","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1038\/369040a0","volume":"369","author":"LM Adleman","year":"1994","unstructured":"Adleman, L.M.: Molecular computation of solutions to combinatorial problems. Nature 369, 40 (1994)","journal-title":"Nature"},{"issue":"2","key":"22_CR2","doi-asserted-by":"publisher","first-page":"305","DOI":"10.3724\/SP.J.1016.2010.00305","volume":"33","author":"Y-K Fan","year":"2010","unstructured":"Fan, Y.-K., Qiang, X.-L., Xu, J.: Sticker model for maximum clique problem and maximum independent set. Chin. J. Comput. 33(2), 305\u2013310 (2010)","journal-title":"Chin. J. Comput."},{"issue":"5210","key":"22_CR3","doi-asserted-by":"publisher","first-page":"542","DOI":"10.1126\/science.7725098","volume":"268","author":"RJ Lipton","year":"1995","unstructured":"Lipton, R.J.: DNA solution of hard computational problems. Science 268(5210), 542\u2013545 (1995)","journal-title":"Science"},{"key":"22_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/3-540-44992-2_3","volume-title":"DNA Computing","author":"RS Braich","year":"2001","unstructured":"Braich, R.S., Johnson, C., Rothemund, P.W.K., Hwang, D., Chelyapov, N., Adleman, L.M.: Solution of a satisfiability problem on a gel-based DNA computer. In: Condon, A., Rozenberg, G. (eds.) DNA 2000. LNCS, vol. 2054, pp. 27\u201342. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44992-2_3"},{"issue":"9","key":"22_CR5","first-page":"1872","volume":"32","author":"B-S Song","year":"2011","unstructured":"Song, B.-S., Yin, Z.-X., Zhen, C., et al.: DNA self-assembly model for general satisfiability problem. J. Chin. Comput. Syst. 32(9), 1872\u20131875 (2011)","journal-title":"J. Chin. Comput. Syst."},{"issue":"1","key":"22_CR6","first-page":"78","volume":"13","author":"L Pan","year":"2003","unstructured":"Pan, L., Jin, X., Liu, Y.: A surface-based DNA algorithm for the minimal vertex cover problem. Prog. Nat. Sci. Mater. Int. 13(1), 78\u201380 (2003)","journal-title":"Prog. Nat. Sci. Mater. Int."},{"unstructured":"Dond, Y.-F., Zhang, J.-X., Yin, Z.-X., et al.: An improved sticker model of the minimal covering problem. J. Electron. Inf. Technol. (4), 556\u2013560 (2005)","key":"22_CR7"},{"issue":"1","key":"22_CR8","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1007\/s11227-013-0892-0","volume":"66","author":"F Wu","year":"2013","unstructured":"Wu, F., Li, K., Sallam, A., et al.: A molecular solution for minimum vertex cover problem in tile assembly model. J. Supercomput. 66(1), 148\u2013169 (2013)","journal-title":"J. Supercomput."},{"doi-asserted-by":"crossref","unstructured":"Al Junid, S.A.M., Tahir, N.M., Majid, Z.A., et al.: Potential of graph theory algorithm approach for DNA sequence alignment and comparison. In: 2012 Third International Conference on Intelligent Systems, Modelling and Simulation (ISMS), pp. 187\u2013190. IEEE (2012)","key":"22_CR9","DOI":"10.1109\/ISMS.2012.123"},{"issue":"11","key":"22_CR10","first-page":"2174","volume":"41","author":"F Wu","year":"2013","unstructured":"Wu, F., Li, K.-L.: An algorithm in tile assembly model for N queen problem. Acta Electron. Sin. 41(11), 2174\u20132180 (2013)","journal-title":"Acta Electron. Sin."},{"issue":"8","key":"22_CR11","doi-asserted-by":"publisher","first-page":"1773","DOI":"10.1166\/jctn.2014.3565","volume":"11","author":"W Xixu","year":"2014","unstructured":"Xixu, W., Jing, L., Zhichao, S., et al.: A molecular computing model for maximum independent set based on origami and greedy algorithm. J. Comput. Theoret. Nanosci. 11(8), 1773\u20131778 (2014)","journal-title":"J. Comput. Theoret. Nanosci."},{"issue":"6","key":"22_CR12","doi-asserted-by":"publisher","first-page":"3734","DOI":"10.1166\/jctn.2016.5205","volume":"13","author":"K Zhou","year":"2016","unstructured":"Zhou, K., Duan, Y., Dong, W., et al.: A matrix algorithm for maximum independent set problem based on sticker model. J. Comput. Theoret. Nanosci. 13(6), 3734\u20133743 (2016)","journal-title":"J. Comput. Theoret. Nanosci."},{"issue":"11","key":"22_CR13","first-page":"2147","volume":"48","author":"X Zhou","year":"2011","unstructured":"Zhou, X., Li, K.-L., Yue, G.-X., et al.: A volume molecular solution for the maximum matching problem on DNA-based computing. J. Comput. Res. Dev. 48(11), 2147\u20132154 (2011)","journal-title":"J. Comput. Res. Dev."},{"issue":"12","key":"22_CR14","first-page":"127","volume":"40","author":"X Wu","year":"2013","unstructured":"Wu, X., Song, C.-Y., Zhang, N., et al.: DNA algorithm for maximum matching problem based on sticker computation model. Comput. Sci. 40(12), 127\u2013132 (2013)","journal-title":"Comput. Sci."},{"issue":"1\u20133","key":"22_CR15","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/j.biosystems.2004.06.005","volume":"78","author":"JY Lee","year":"2004","unstructured":"Lee, J.Y., Shin, S.Y., Park, T.H., et al.: Solving traveling salesman problems with DNA molecules encoding numerical values. BioSystems 78(1\u20133), 39\u201347 (2004)","journal-title":"BioSystems"},{"issue":"6","key":"22_CR16","first-page":"1299","volume":"17","author":"YF Dong","year":"2005","unstructured":"Dong, Y.F., Tan, G.J., Zhang, S.M.: Algorithm of TSP based on sticker systems of DNA computing. Acta Simulata Syst. Sin. 17(6), 1299\u20131387 (2005)","journal-title":"Acta Simulata Syst. Sin."},{"issue":"2","key":"22_CR17","first-page":"316","volume":"29","author":"Z Kang","year":"2007","unstructured":"Kang, Z., Liu, W.B., Jin, X.U.: Algorithm of DNA computing of TSP. Syst. Eng. Electron. 29(2), 316\u2013319 (2007)","journal-title":"Syst. Eng. Electron."},{"issue":"3","key":"22_CR18","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/j.jpdc.2008.06.014","volume":"69","author":"IM Mart\u00ednez-P\u00e9rez","year":"2009","unstructured":"Mart\u00ednez-P\u00e9rez, I.M., Zimmermann, K.H.: Parallel bioinspired algorithms for NP complete graph problems. J. Parallel Distrib. Comput. 69(3), 221\u2013229 (2009)","journal-title":"J. Parallel Distrib. Comput."},{"issue":"4","key":"22_CR19","doi-asserted-by":"publisher","first-page":"615","DOI":"10.1089\/cmb.1998.5.615","volume":"5","author":"S Roweis","year":"1998","unstructured":"Roweis, S., Winfree, E., Burgoyne, R., et al.: A sticker-based model for DNA computation. J. Comput. Biol. 5(4), 615\u2013629 (1998)","journal-title":"J. Comput. Biol."},{"key":"22_CR20","volume-title":"DNA computing models","author":"Z Ignatova","year":"2008","unstructured":"Ignatova, Z., Mart\u00ednez-P\u00e9rez, I., Zimmermann, K.H.: DNA computing models. Springer, Boston (2008)"},{"unstructured":"Hasudungan, R., Rohani, A.B., Rozlina, M.: DNA computing and its application on NP completeness problem. Asian Pac. J. Trop. Dis. (2013)","key":"22_CR21"}],"container-title":["Communications in Computer and Information Science","Data Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-13-2206-8_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T13:08:07Z","timestamp":1710248887000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-13-2206-8_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9789811322051","9789811322068"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-981-13-2206-8_22","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"9 September 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}