{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:23:24Z","timestamp":1725560604980},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540282273"},{"type":"electronic","value":"9783540319078"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11538356_10","type":"book-chapter","created":{"date-parts":[[2005,9,27]],"date-time":"2005-09-27T10:24:05Z","timestamp":1127816645000},"page":"90-98","source":"Crossref","is-referenced-by-count":0,"title":["DNA Computing Model of Graph Isomorphism Based on Three Dimensional DNA Graph Structures"],"prefix":"10.1007","author":[{"given":"Zhixiang","family":"Yin","sequence":"first","affiliation":[]},{"given":"Jianzhong","family":"Cui","sequence":"additional","affiliation":[]},{"given":"Jing","family":"Yang","sequence":"additional","affiliation":[]},{"given":"Guangwu","family":"Liu","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"10_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":"10_CR2","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1126\/science.7725098","volume":"268","author":"R.J. Lipton","year":"1995","unstructured":"Lipton, R.J.: DNA solution of hard computation problem. Science\u00a0268, 583\u2013585 (1995)","journal-title":"Science"},{"key":"10_CR3","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/S0303-2647(99)00030-1","volume":"52","author":"A.R. Cukras","year":"1999","unstructured":"Cukras, A.R., Faulhammer, D., Lipton, R.J., et al.: Chess games: A model for RNA-based computation. Biosystems\u00a052, 35\u201345 (1999)","journal-title":"Biosystems"},{"key":"10_CR4","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1126\/science.278.5337.446","volume":"278","author":"Q. Ouyang","year":"1997","unstructured":"Ouyang, Q.: DNA solution of the maximal clique problem. Science\u00a0278, 446\u2013449 (1997)","journal-title":"Science"},{"key":"10_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":"10_CR6","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1038\/35001232","volume":"403","author":"Q.H. Liu","year":"2000","unstructured":"Liu, Q.H.: DNA computing on surfaces. Nature\u00a0403, 175\u2013179 (2000)","journal-title":"Nature"},{"key":"10_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0303-2647(00)00133-7","volume":"59","author":"H.Y. Wu","year":"2001","unstructured":"Wu, H.Y.: An improved surface-based method for DNA computation. Boisystems\u00a059, 1\u20135 (2001)","journal-title":"Boisystems"},{"key":"10_CR8","doi-asserted-by":"publisher","first-page":"430","DOI":"10.1038\/35106533","volume":"414","author":"Y. Benenson","year":"2001","unstructured":"Benenson, Y., Paz-Elizur, T., Adar, R., et al.: Programmable and autonomous computing machine made of biomolecules. Nature\u00a0414, 430\u2013434 (2001)","journal-title":"Nature"},{"key":"10_CR9","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1126\/science.1069528","volume":"296","author":"R.S. Braich","year":"2002","unstructured":"Braich, R.S., Chelyapov, N., Johnson, C., et al.: Solution of a 20-Variable 3-SAT Problem on a DNA Computer. Science\u00a0296, 499\u2013502 (2002)","journal-title":"Science"},{"key":"10_CR10","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1089\/cmb.1998.5.255","volume":"5","author":"L.M. Smith","year":"1998","unstructured":"Smith, L.M., Corn, R.M., Condon, A.E., et al.: A surface-based approach to DNA computation. Journal of Computational Biology\u00a05, 255\u2013267 (1998)","journal-title":"Journal of Computational Biology"},{"key":"10_CR11","volume-title":"Proceeding of the 4th DNA Based Computing Workshop","author":"N. Jonoska","year":"1998","unstructured":"Jonoska, N., Karl, S.A., Saito, M.: Three dimensional DNA structures in computing. In: Proceeding of the 4th DNA Based Computing Workshop. Springer, Philadephia (1998)"},{"key":"10_CR12","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/S0303-2647(03)00053-4","volume":"70","author":"Z.X. Yin","year":"2003","unstructured":"Yin, Z.X., Zhang, F.Y., Xu, J.: The general 0-1 programming problem based on DNA computing. Biosystems\u00a070, 73\u201379 (2003)","journal-title":"Biosystems"},{"key":"10_CR13","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03563-4","volume-title":"DNA Computing: New Computing Paradigms","author":"G. Paun","year":"1998","unstructured":"Paun, G., Grzegorz, R., Arto, S.: DNA Computing: New Computing Paradigms. Springer, Heidelberg (1998)"},{"key":"10_CR14","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-349-03521-2","volume-title":"Graph Theory with Applications","author":"J.A. Bondy","year":"1976","unstructured":"Bondy, J.A., Murty, U.S.R.: Graph Theory with Applications. The Macmillan Press Ltd., New York (1976)"},{"key":"10_CR15","doi-asserted-by":"publisher","first-page":"3745","DOI":"10.1073\/pnas.83.11.3746","volume":"83","author":"K.J. Breslauer","year":"1986","unstructured":"Breslauer, K.J., Frank, R., Blocker, H., et al.: Predicting DNA duplex stability from the base sequence. Proc. Natl. Acad. Sci.\u00a083, 3745\u20133750 (1986)","journal-title":"Proc. Natl. Acad. Sci."},{"key":"10_CR16","doi-asserted-by":"publisher","first-page":"4630","DOI":"10.1093\/nar\/gkh802","volume":"15","author":"P. Pancoska","year":"2004","unstructured":"Pancoska, P., Moravek, Z., Moll, U.M.: Rational design of DNA sequences for nanotechnology, microarrays and molecular computers using Eulerian graphs. Nucleic Acids Research\u00a015, 4630\u20134645 (2004)","journal-title":"Nucleic Acids Research"},{"key":"10_CR17","unstructured":"Beigel, R., Fu, B.: Molecular Approximation Algorithm for NP Optimization Problems. In: 3rd DIMACS Meeting on DNA Based Computers. Univ. of Penns (1997)"},{"key":"10_CR18","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/S0304-3975(99)00100-0","volume":"2","author":"L. Kari","year":"2000","unstructured":"Kari, L., Gloor, G., Yu, S.: Using DNA to solve the Bounded Post Correspondence Problem. Theoretical Computer Science\u00a02, 193\u2013203 (2000)","journal-title":"Theoretical Computer Science"},{"key":"10_CR19","doi-asserted-by":"crossref","first-page":"524","DOI":"10.1021\/ci010016o","volume":"42","author":"Y. Liu","year":"2002","unstructured":"Liu, Y., Xu, J., Pan, L., et al.: DNA solution of a graph coloring problem. Journal of Chemical Information and Computer Science\u00a042, 524\u2013528 (2002)","journal-title":"Journal of Chemical Information and Computer Science"},{"key":"10_CR20","doi-asserted-by":"crossref","first-page":"529","DOI":"10.1021\/ci010017g","volume":"42","author":"Y. Liu","year":"2002","unstructured":"Liu, Y., Guo, X., Xu, J., et al.: Some Notes on 2-D Graphical Representation of DNA Sequence. Journal of Chemical Information and Computer Science\u00a042, 529\u2013533 (2002)","journal-title":"Journal of Chemical Information and Computer Science"},{"key":"10_CR21","doi-asserted-by":"crossref","first-page":"1176","DOI":"10.1021\/ci025546e","volume":"42","author":"W.B. Liu","year":"2002","unstructured":"Liu, W.B., Xu, J.: A DNA Algorithm for the Graph Coloring Problem. Journal of Chemical Information and Computers\u00a042, 1176\u20131178 (2002)","journal-title":"Journal of Chemical Information and Computers"},{"key":"10_CR22","doi-asserted-by":"crossref","first-page":"222","DOI":"10.1021\/ci010046r","volume":"42","author":"Z. Yin","year":"2002","unstructured":"Yin, Z., Zhang, F., Xu, J.: A Chinese postman problem based on DNA computing. Journal of Chemical Information and Computer Sciences\u00a042, 222\u2013224 (2002)","journal-title":"Journal of Chemical Information and Computer Sciences"},{"key":"10_CR23","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/S0303-2647(03)00053-4","volume":"70","author":"Z.X. Yin","year":"2003","unstructured":"Yin, Z.X., Zhang, F.Y., Xu, J.: A General 0-1 Programming Problem Based on DNA Computing. Biosystem\u00a070, 73\u201378 (2003)","journal-title":"Biosystem"},{"key":"10_CR24","doi-asserted-by":"crossref","first-page":"1876","DOI":"10.1021\/ci034119d","volume":"43","author":"W.B. Liu","year":"2003","unstructured":"Liu, W.B., Wang, S.D., Xu, J.: DNA Sequence Design Based on Template Strategy. J. Chem. Inf. Comput. Sci.\u00a043, 1876\u20131881 (2003)","journal-title":"J. Chem. Inf. Comput. Sci."},{"key":"10_CR25","first-page":"1942","volume":"11","author":"W.B. Liu","year":"2003","unstructured":"Liu, W.B., Wang, S.D., Xu, J.: Solving the 3-SAT Problem Based on DNA Computing. J. Chem. Inf. Comput. Sci.\u00a011, 1942\u20131946 (2003)","journal-title":"J. Chem. Inf. Comput. Sci."},{"key":"10_CR26","unstructured":"Liu, W.B., Wang, S.D., Xu, J.: The Hamiltonian Cycle Problem Based on DNA Computing. In: Proceedings of the 4th Asia-Pacific Conference on Simulated Evolution And Learning, vol.\u00a01, pp. 313\u2013317 (2002)"},{"key":"10_CR27","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1023\/A:1020808521487","volume":"31","author":"S. Wang","year":"2002","unstructured":"Wang, S.: DNA Computing of Bipartite Graphs for Maximum Matching. Journal of Mathematical Chemistry\u00a031, 271\u2013279 (2002)","journal-title":"Journal of Mathematical Chemistry"},{"key":"10_CR28","first-page":"81","volume":"13","author":"L.Q. Pan","year":"2003","unstructured":"Pan, L.Q., Xu, J.: A Surface-Based DNA Algorithm for the minimal vertex cover Problem. Progress in Natural Science\u00a013, 81\u201384 (2003)","journal-title":"Progress in Natural Science"}],"container-title":["Lecture Notes in Computer Science","Advances in Intelligent Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11538356_10.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T02:53:39Z","timestamp":1619492019000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11538356_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540282273","9783540319078"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/11538356_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}