{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T17:07:18Z","timestamp":1725469638225},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540372776"},{"type":"electronic","value":"9783540372820"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11816102_35","type":"book-chapter","created":{"date-parts":[[2006,8,31]],"date-time":"2006-08-31T12:43:03Z","timestamp":1157028183000},"page":"320-327","source":"Crossref","is-referenced-by-count":3,"title":["A New DNA-Based Approach to Solve the Maximum Weight Clique Problem"],"prefix":"10.1007","author":[{"given":"Aili","family":"Han","sequence":"first","affiliation":[]},{"given":"Daming","family":"Zhu","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"35_CR1","doi-asserted-by":"publisher","first-page":"1021","DOI":"10.1126\/science.7973651","volume":"266","author":"L.M. Adleman","year":"1994","unstructured":"Adleman, L.M.: Molecular Computation of Solutions to Combinatorial problems. Science\u00a0266, 1021\u20131024 (1994)","journal-title":"Science"},{"key":"35_CR2","doi-asserted-by":"publisher","first-page":"542","DOI":"10.1126\/science.7725098","volume":"268","author":"R.J. Lipton","year":"1995","unstructured":"Lipton, R.J.: DNA solution of Hard Computational Problems. Science\u00a0268, 542\u2013545 (1995)","journal-title":"Science"},{"key":"35_CR3","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1126\/science.278.5337.446","volume":"278","author":"Q. Ouyang","year":"1997","unstructured":"Ouyang, Q., Kaplan, P.D., Liu, S., et al.: DNA Solution of the Maximal Clique Problem. Science\u00a0278, 446\u2013449 (1997)","journal-title":"Science"},{"key":"35_CR4","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/S0303-2647(00)00091-5","volume":"57","author":"T. Head","year":"2000","unstructured":"Head, T., Rozenberg, G., Bladergroen, R.S., et al.: Computing with DNA by Operating on Plasmids. Biosystems\u00a057, 87\u201393 (2000)","journal-title":"Biosystems"},{"key":"35_CR5","doi-asserted-by":"publisher","first-page":"1223","DOI":"10.1126\/science.288.5469.1223","volume":"288","author":"K. Sakamoto","year":"2000","unstructured":"Sakamoto, K., Gouzu, H., Komiya, K., et al.: Molecular Computation by DNA Hairpin Formation. Science\u00a0288, 1223\u20131226 (2000)","journal-title":"Science"},{"key":"35_CR6","first-page":"718","volume-title":"Proceedings of the Genetic Programming","author":"A. Narayanan","year":"1998","unstructured":"Narayanan, A., Zorbalas, S., et al.: DNA Algorithms for Computing Shortest Paths. In: Proceedings of the Genetic Programming, pp. 718\u2013723. Morgan Kaufmann, San Francisco (1998)"},{"key":"35_CR7","first-page":"994","volume-title":"Proceedings of the Congress on Evolutionary Computation","author":"S.Y. Shin","year":"1999","unstructured":"Shin, S.Y., Zhang, B.T., Jun, S.S., et al.: Solving Traveling Salesman Problems Using Molecular Programming. In: Proceedings of the Congress on Evolutionary Computation, pp. 994\u20131000. IEEE Press, Los Alamitos (1999)"},{"key":"35_CR8","series-title":"Lecture Notes in Computer Science","first-page":"231","volume-title":"DNA Computing","author":"M. Yamamura","year":"2002","unstructured":"Yamamura, M., Hiroto, Y., Matoba, T.: Solutions of Shortest Path Problems by Concentration Control. In: Jonoska, N., Seeman, N.C. (eds.) DNA 2001. LNCS, vol.\u00a02340, pp. 231\u2013240. Springer, Heidelberg (2002)"},{"key":"35_CR9","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/j.biosystems.2004.06.005","volume":"78","author":"J.Y. 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\u00a078, 39\u201347 (2004)","journal-title":"BioSystems"},{"key":"35_CR10","unstructured":"Yin, Z.: DNA Computing in Graph and Combination Optimization, pp. 57\u201372. Science Press (2004) (in Chinese)"},{"key":"35_CR11","first-page":"13","volume":"32","author":"R. Ma","year":"2004","unstructured":"Ma, R., Zhang, Q., Gao, L., Xu, J.: Using DNA to Solve the Maximum Weight Clique of Graphs. ACTA Electronica Sinica\u00a032, 13\u201316 (2004)","journal-title":"ACTA Electronica Sinica"},{"key":"35_CR12","unstructured":"Xu, J., Wang, S., Pan, Q., Paun, G., Rozenberg, G., Salomaa, A.: write: DNA Computing: New Computing Paradigms, vol.\u00a01, pp. 3\u201354. Tsinghua University publishing company (2004) (in Chinese)"},{"key":"35_CR13","first-page":"118","volume":"27","author":"W. Liu","year":"2003","unstructured":"Liu, W., Wang, S., Xu, J.: Research on the Encoding Method of DNA Computing. Computer Engineering and Applications\u00a027, 118\u2013121 (2003)","journal-title":"Computer Engineering and Applications"},{"key":"35_CR14","first-page":"2337","volume":"13","author":"A. Han","year":"2002","unstructured":"Han, A., Yang, Z., et al.: Complexity Analysis for HEWN Algorithm. Journal of Software\u00a013, 2337\u20132342 (2002) (in Chinese)","journal-title":"Journal of Software"},{"key":"35_CR15","unstructured":"Han, A.: Complexity Research for B Algorithm. In: Proceedings of the Tenth Joint Internation-al Computer Conference, pp. 188\u2013192. International Academic Publishers (2004)"},{"key":"35_CR16","doi-asserted-by":"publisher","first-page":"1431","DOI":"10.1360\/crad20050824","volume":"42","author":"L. Wang","year":"2005","unstructured":"Wang, L., Lin, Y., Li, Z.: DNA Computation for a Category of Special Integer Planning Problem. Computer Research and Development\u00a042, 1431\u20131437 (2005) (in Chinese)","journal-title":"Computer Research and Development"},{"key":"35_CR17","doi-asserted-by":"publisher","first-page":"1241","DOI":"10.1360\/crad20050723","volume":"42","author":"Z. Chen","year":"2005","unstructured":"Chen, Z., Li, X., Wang, L., et al.: A Surface-Based DNA Algorithm for the Perfect Matching Problem. Computer Research and Development\u00a042, 1241\u20131246 (2005) (in Chinese)","journal-title":"Computer Research and Development"},{"key":"35_CR18","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1007\/BF02944785","volume":"19","author":"G. Lancia","year":"2004","unstructured":"Lancia, G.: Integer Programming Models for Computional Biology Problems. Journal of Computer Science and Technology\u00a019, 60\u201377 (2004)","journal-title":"Journal of Computer Science and Technology"},{"key":"35_CR19","doi-asserted-by":"crossref","unstructured":"Ibrahim, Z., Tsuboi, Y., Muhammad, M.S., et al.: DNA Implementation of k-shortest Paths Computation. In: IEEE Congress on Evolutionary Computation. IEEE CEC 2005 Proceedings, vol.\u00a01, pp. 707\u2013713 (2005)","DOI":"10.1109\/CEC.2005.1554752"},{"key":"35_CR20","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1038\/35001232","volume":"403","author":"Q. Liu","year":"2000","unstructured":"Liu, Q., Wang, L., Frutos, A.G., et al.: DNA Computing on Surfaces. Nature\u00a0403, 175\u2013179 (2000)","journal-title":"Nature"}],"container-title":["Lecture Notes in Computer Science","Computational Intelligence and Bioinformatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11816102_35.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:28:16Z","timestamp":1619494096000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11816102_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540372776","9783540372820"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/11816102_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}