{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T01:05:28Z","timestamp":1725498328097},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540250555"},{"type":"electronic","value":"9783540323914"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/3-540-32391-0_130","type":"book-chapter","created":{"date-parts":[[2007,12,12]],"date-time":"2007-12-12T23:24:22Z","timestamp":1197501862000},"page":"1278-1287","source":"Crossref","is-referenced-by-count":0,"title":["DNA-based Algorithm for 0\u20131 Planning Problem"],"prefix":"10.1007","author":[{"given":"Wang","family":"Lei","sequence":"first","affiliation":[]},{"given":"Chen","family":"Zhiping","sequence":"additional","affiliation":[]},{"given":"Jiang","family":"Xinhua","sequence":"additional","affiliation":[]},{"given":"Liu","family":"Shaoli","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"130_CR1","first-page":"1496","volume":"15","author":"L. Gao","year":"2003","unstructured":"Gao Lin, Xu Jin. (2003) DNA solution of vertex cover problem based on sticker model. Chinese Journal of Electronics. Vol.15, No.1:1496\u20131500.","journal-title":"Chinese Journal of Electronics"},{"key":"130_CR2","first-page":"151","volume":"44","author":"E. Bach","year":"1999","unstructured":"Bach, E. et. al. (1999) DNA Models and Algorithms for NP-Complete Problems. Proceedings of the 11th Annual Meeting on DNA Based Computers. Vol.44: 151\u2013161.","journal-title":"Proceedings of the 11th Annual Meeting on DNA Based Computers"},{"issue":"1","key":"130_CR3","first-page":"1","volume":"26","author":"J. Xu","year":"2003","unstructured":"Xu Jin, Zhang Lei. (2003) DNA Computer Principle, Advances and Difficulties (1): Biological Computing System and Its Applications to Graph Theory. Chinese Journal of Computers. Vol.26, No.1: 1\u201311.","journal-title":"Chinese Journal of Computers"},{"key":"130_CR4","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1126\/science.273.5277.912","volume":"273","author":"G. Frank","year":"1996","unstructured":"Frank G, Makiko F. Carter B. (1996) Making DNA add. Science. Vol.273: 220\u2013223.","journal-title":"Science"},{"key":"130_CR5","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/S0303-2647(99)00043-X","volume":"52","author":"B. Yurke","year":"1999","unstructured":"Yurke B, Mills Jr. A P. Cheng Siu Lai. (1999) DNA implementation of addition in which the input strands are separate from the operator strands. Bio-systems. Vol.52: 165\u2013174.","journal-title":"Bio-systems"},{"key":"130_CR6","first-page":"165","volume":"52","author":"J. S. Oliver","year":"1999","unstructured":"Oliver J S. (1999) Computation with DNA: Matrix multiplication. DIAMACS series. Discrete Mathematics and Theoretical Computer Science. Vol.52: 165\u2013171.","journal-title":"Discrete Mathematics and Theoretical Computer Science"},{"key":"130_CR7","doi-asserted-by":"publisher","first-page":"1021","DOI":"10.1126\/science.7973651","volume":"266","author":"L. M. Alderman","year":"1994","unstructured":"Alderman, L. M. (1994) Molecular computations to combinatorial problems. Science. Vol.266: 1021\u20131024","journal-title":"Science"},{"key":"130_CR8","doi-asserted-by":"publisher","first-page":"542","DOI":"10.1126\/science.7725098","volume":"268","author":"R. Lipton","year":"1995","unstructured":"R Lipton. (1995) Using DNA to solve NP-Complete Problems. Science. Vol.268: 542\u2013545.","journal-title":"Science"},{"issue":"5","key":"130_CR9","doi-asserted-by":"publisher","first-page":"1223","DOI":"10.1126\/science.288.5469.1223","volume":"288","author":"Sakamoto","year":"2000","unstructured":"Sakamoto et.al. (2000) Molecular computation by DNA hairpin formation. Science. Vol.288, No.5: 1223\u20131226.","journal-title":"Science"},{"key":"130_CR10","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1090\/dimacs\/044\/10","volume":"44","author":"Q. Liu","year":"1999","unstructured":"Liu Q, Guo Z, Fei Z et al. (1999) A surface based approach to DNA computation. Discrete Mathmatics and Theoretical Computer Science. Vol.44: 123\u2013132.","journal-title":"Discrete Mathmatics and Theoretical Computer Science"},{"key":"130_CR11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0303-2647(00)00133-7","volume":"59","author":"H.-Yang. Wu","year":"2001","unstructured":"Wu Hao-Yang. (2001) An improved surface based method for DNA computation. Bio-systems. Vol.59: 1\u20135.","journal-title":"Bio-systems"},{"issue":"1","key":"130_CR12","first-page":"1","volume":"15","author":"Z. Yin","year":"2003","unstructured":"Yin Zhixiang, Zhang Fengyue, Xu Jin. (2003) 0-1 planning problem based on DNA computing. Chinese Journal of electronics and Information. Vol.15, No.1:1\u20135.","journal-title":"Chinese Journal of electronics and Information"}],"container-title":["Advances in Soft Computing","Soft Computing as Transdisciplinary Science and Technology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-32391-0_130.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T00:52:40Z","timestamp":1619571160000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-32391-0_130"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540250555","9783540323914"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-32391-0_130","relation":{},"subject":[]}}