{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T14:07:37Z","timestamp":1725718057122},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642370144"},{"type":"electronic","value":"9783642370151"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-37015-1_76","type":"book-chapter","created":{"date-parts":[[2013,3,5]],"date-time":"2013-03-05T04:34:18Z","timestamp":1362458058000},"page":"869-875","source":"Crossref","is-referenced-by-count":7,"title":["An Improved DNA Computing Method for Elevator Scheduling Problem"],"prefix":"10.1007","author":[{"given":"Hong-Chao","family":"Zhao","sequence":"first","affiliation":[]},{"given":"Xi-Yu","family":"Liu","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"76_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":"76_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":"76_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":"76_CR4","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":"76_CR5","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/3-540-32391-0_43","volume":"29","author":"M.S. Muhanmmad","year":"2005","unstructured":"Muhanmmad, M.S., Ueda, S., Watada, J., et al.: Solving Elevator Scheduling Problem Using DNA Computing Approach. Advances in Soft Computing\u00a029, 359\u2013370 (2005)","journal-title":"Advances in Soft Computing"},{"key":"76_CR6","doi-asserted-by":"publisher","first-page":"1065","DOI":"10.1007\/978-3-540-78293-3_24","volume":"115","author":"J. Watada","year":"2008","unstructured":"Watada, J.: DNA Computing and Its Applications. Studies in Computational Intelligence\u00a0115, 1065\u20131089 (2008)","journal-title":"Studies in Computational Intelligence"}],"container-title":["Lecture Notes in Computer Science","Pervasive Computing and the Networked World"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-37015-1_76","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,11]],"date-time":"2019-05-11T14:30:40Z","timestamp":1557585040000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-37015-1_76"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642370144","9783642370151"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-37015-1_76","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}