{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T09:52:26Z","timestamp":1725529946805},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540768029"},{"type":"electronic","value":"9783540768036"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-76803-6_13","type":"book-chapter","created":{"date-parts":[[2009,3,26]],"date-time":"2009-03-26T10:01:05Z","timestamp":1238061665000},"page":"293-322","source":"Crossref","is-referenced-by-count":0,"title":["DNA Encoding Methods in the Field of DNA Computing"],"prefix":"10.1007","author":[{"given":"Aili","family":"Han","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daming","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"13_CR1_1","doi-asserted-by":"publisher","first-page":"1021","DOI":"10.1126\/science.7973651","volume":"266","author":"L M Adleman","year":"1994","unstructured":"Adleman L M (1994) Molecular Computation of Solutions to Combinatorial problems. Science 266:1021\u20131024","journal-title":"Science"},{"key":"13_CR2_1","doi-asserted-by":"publisher","first-page":"542","DOI":"10.1126\/science.7725098","volume":"268","author":"R J Lipton","year":"1995","unstructured":"Lipton R J (1995) DNA solution of hard computational problems. Science 268:542\u2013545","journal-title":"Science"},{"key":"13_CR3_1","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 (1997) DNA solution of the maximal clique problem. Science 278:446\u2013449","journal-title":"Science"},{"key":"13_CR4_1","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 (2000) Computing with DNA by operating on plasmids. Biosystems 57:87\u201393","journal-title":"Biosystems"},{"key":"13_CR5_1","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 (2000) Molecular computation by DNA hairpin formation. Science 288:1223\u20131226","journal-title":"Science"},{"key":"13_CR6_1","unstructured":"Narayanan A, Zorbalas S, et al (1998) DNA algorithms for computing shortest paths. In: Proceedings of the Genetic Programming, Morgan Kaufmann 718\u2013723"},{"key":"13_CR7_1","unstructured":"Shin S Y, Zhang B T, Jun S S, et al (1999) Solving traveling salesman problems using molecular programming. In: Proceedings of the Congress on Evolutionary Computation. IEEE Press 994\u20131000"},{"key":"13_CR8_1","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/3-540-48017-X_19","volume":"2340","author":"M Yamamoto","year":"2002","unstructured":"Yamamoto M, Matsuura N, Shiba T, et al (2002) Solutions of shortest path problems by concentration control. Lecture Notes in Computer Science 2340:203\u2013212","journal-title":"Lecture Notes in Computer Science"},{"key":"13_CR9_1","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 (2004) Solving traveling salesman problems with DNA molecules encoding numerical values. BioSystems 78:39\u201347","journal-title":"BioSystems"},{"key":"13_CR10_1","unstructured":"Han A, Zhu D (2006) DNA Encoding Method of Weight for Chinese Postman Problem. In: Proceedings of 2006 IEEE Congress on Evolutionary Computation. IEEE Press 2696\u20132701"},{"key":"13_CR11_1","doi-asserted-by":"publisher","first-page":"1053","DOI":"10.1360\/crad20070619","volume":"44","author":"A Han","year":"2007","unstructured":"Han A, Zhu D (2007) DNA Computing Model Based on a New Scheme of Encoding Weight for Chinese Postman Problem. Computer Research and Development 44:1053\u20131062","journal-title":"Computer Research and Development"},{"key":"13_CR12_1","doi-asserted-by":"crossref","unstructured":"Han A (2006) RLM: A New Method of Encoding Weights in DNA Strands. In: Proceedings of the Sixth International Conference on Hybrid Intelligent Systems. IEEE Press 118\u2013121","DOI":"10.1109\/HIS.2006.264900"},{"key":"13_CR13_1","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1007\/11816102_35","volume":"4115","author":"A Han","year":"2006","unstructured":"Han A, Zhu D (2006) A New DNA-Based Approach to Solve the Maximum Weight Clique Problem. Lecture Notes in Computer Science 4115:320\u2013327","journal-title":"Lecture Notes in Computer Science"},{"key":"13_CR14_1","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1007\/11816102_36","volume":"4115","author":"A Han","year":"2006","unstructured":"Han A, Zhu D (2006) A New DNA Encoding Method for Traveling Salesman Problem. Lecture Notes in Computer Science 4115:328\u2013335","journal-title":"Lecture Notes in Computer Science"},{"key":"13_CR15_1","doi-asserted-by":"crossref","unstructured":"Han A, Zhu D (2006) DNA Computing Model for the Minimum Spanning Tree Problem. In: Proceedings of the 8th International Symposium of Symbolic and Numeric Algorithms for Scientific Computing. IEEE Press 372\u2013377","DOI":"10.1109\/SYNASC.2006.31"},{"key":"13_CR16_1","doi-asserted-by":"crossref","unstructured":"Han A (2006) DNA Computing Model for the 0\/1 Knapsack Problem. In: Proceedings of the Sixth International Conference on Hybrid Intelligent Systems. IEEE Press 122\u2013125","DOI":"10.1109\/HIS.2006.264901"},{"key":"13_CR17_1","unstructured":"Paun G, Rozenberg G, Salomaa A (1998) DNA Computing: New Computing Paradigms. Springer, Berlin. Translated by Xu Jin, Wang Shudong, Pan Linqiang (2004) Tsinghua University Press, Beijing"},{"key":"13_CR18_1","unstructured":"Setubal J, Meidanis J (1997) Introduction to Computational Molecular Biology. Cole Publishing Company, Thomson. translated by Zhu H, et al (2003) Science Press, Beijing"},{"key":"13_CR19_1","unstructured":"Zhang B T, Shin S Y (1998) Molecular algorithms for efficient and reliable DNA computing. In: Genetic Programming, Morgan Kaufmann 735\u2013742"},{"key":"13_CR20_1","first-page":"1","volume":"26","author":"J Xu","year":"2003","unstructured":"Xu J, Zhang L (2003) DNA Computer Principle, Advances and Difficulties (I): Biological Computing System and Its Applications to Graph Theory. Journal of Computer Science and Technology 26: 1\u201310","journal-title":"Journal of Computer Science and Technology"},{"key":"13_CR21_1","volume-title":"DNA Computing in Graph and Combination Optimization","author":"Z Yin","year":"2004","unstructured":"Yin Z (2004) DNA Computing in Graph and Combination Optimization. Science Press, Beijing"},{"key":"13_CR22_1","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 (2005) DNA Computation for a Category of Special Integer Planning Problem. Computer Research and Development 42:1431\u20131437","journal-title":"Computer Research and Development"},{"key":"13_CR23_1","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 (2005) A Surface-Based DNA Algorithm for the Perfect Matching Problem. Computer Research and Development 42:1241\u20131246","journal-title":"Computer Research and Development"},{"key":"13_CR24_1","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 (2002) Solution of a 20-variable 3-SAT problem on a DNA computer. Science 296:499\u2013502","journal-title":"Science"},{"key":"13_CR25_1","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1007\/BF02944785","volume":"19","author":"G Lancia","year":"2004","unstructured":"Lancia G (2004) Integer Programming Models for Computional Biology Problems. Journal of Computer Science and Technology 19:60\u201377","journal-title":"Journal of Computer Science and Technology"},{"key":"13_CR26_1","doi-asserted-by":"crossref","unstructured":"Ibrahim Z, Tsuboi Y, Muhammad M S, et al (2005) DNA implementation of k-shortest paths computation. In: Proceedings of IEEE Congress on Evolutionary Computation. IEEE press 707\u2013713","DOI":"10.1109\/CEC.2005.1554752"},{"key":"13_CR27_1","unstructured":"Jonoska N, Kari S A, Saito M (1998) Graph structures in DNA computing. In: Computing with Bio-Molecules\u2013Theory and Experiments. Penn State 93\u2013110"}],"container-title":["Studies in Computational Intelligence","Computational Intelligence in Bioinformatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-76803-6_13.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:39:22Z","timestamp":1619519962000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-76803-6_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540768029","9783540768036"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-76803-6_13","relation":{},"ISSN":["1860-949X"],"issn-type":[{"type":"print","value":"1860-949X"}],"subject":[],"published":{"date-parts":[[2008]]}}}