{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,24]],"date-time":"2025-01-24T05:21:28Z","timestamp":1737696088286,"version":"3.33.0"},"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_43","type":"book-chapter","created":{"date-parts":[[2007,12,12]],"date-time":"2007-12-12T23:24:22Z","timestamp":1197501862000},"page":"359-370","source":"Crossref","is-referenced-by-count":2,"title":["Solving Elevator Scheduling Problem Using DNA Computing Approach"],"prefix":"10.1007","author":[{"given":"Mohd Saufee","family":"Muhammad","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Satomi","family":"Ueda","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Osamu","family":"Ono","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Junzo","family":"Watada","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marzuki","family":"Khalid","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"43_CR1","doi-asserted-by":"publisher","first-page":"1021","DOI":"10.1126\/science.7973651","volume":"266","author":"L. Adleman","year":"1994","unstructured":"Adleman, L.: Molecular Computation of Solutions to Combinatorial Problems. Science, Vol. 266 (1994) 1021\u20131024","journal-title":"Science"},{"key":"43_CR2","doi-asserted-by":"crossref","unstructured":"Adleman, L.M.: Computing with DNA. Scientific American (1998) 34\u201341","DOI":"10.1038\/scientificamerican0898-54"},{"key":"43_CR3","first-page":"67","volume":"27","author":"R. Lipton","year":"1996","unstructured":"Lipton R.: Speeding up Computations via Molecular Biology. In DIMACS Series, Vol. 27 (1996) 67\u201374.","journal-title":"DIMACS Series"},{"key":"43_CR4","doi-asserted-by":"crossref","unstructured":"Reif, J.H.: Parallel Biomolecular Computation: Models and Simulations. Proceedings of 7th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA\u201995) 213\u2013223.","DOI":"10.1145\/215399.215446"},{"key":"43_CR5","first-page":"145","volume":"2054","author":"J.H. Reif","year":"2001","unstructured":"Reif, J.H., LaBean, T. H.,: Computationally Inspired Biotechnologies: Improved DNA Synthesis and Associative Search Using Error-Correcting Codes and Vector-Quantization, Lecture Notes in Computer Science, Springer-Verlag, Vol. 2054 (2001) 145\u2013172","journal-title":"Computationally Inspired Biotechnologies: Improved DNA Synthesis and Associative Search Using Error-Correcting Codes and Vector-Quantization"},{"key":"43_CR6","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1038\/21092","volume":"399","author":"F.C. Bancroft","year":"1999","unstructured":"Bancroft, F.C.: Hiding messages in DNA microdots, Nature, (1999) Vol. 399 533\u2013534","journal-title":"Nature"},{"key":"43_CR7","unstructured":"Kojima, S., Watada, J., Ueda, S., Ono, O.: Optimal Group Control of Elevators based on DNA Computing. Proceeding of FIC2004 (2004) 156\u2013161"},{"key":"43_CR8","unstructured":"Narayanan, A., Zorbalas, S.: DNA Algorithms for Computing Shortest Paths. Proceedings of Genetic Programming, (1998) 718\u2013723"},{"key":"43_CR9","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1142\/S1469026802000750","volume":"2","author":"Y. Yamamoto","year":"2002","unstructured":"Yamamoto, Y., Kameda, A., Matsuura, N., Shiba, T., Kawazoe, Y., Ahochi, A.: Local Search by Concentration-Controlled DNA Computing. International Journal of Computational Intelligence and Applications, Vol. 2 (2002) 447\u2013455","journal-title":"International Journal of Computational Intelligence and Applications"},{"key":"43_CR10","first-page":"73","volume":"2568","author":"J.Y. Lee","year":"2003","unstructured":"Lee, J.Y., Shin, S.Y., Augh, S.J., Park, T.H., Zhang, B.T.: Temperature Gradient-Based DNA Computing for Graph Problems with Weighted Edges. Lecture Notes in Computer Science, Springer-Verlag, Vol. 2568 (2003) 73\u201384","journal-title":"Temperature Gradient-Based DNA Computing for Graph Problems with Weighted Edges"},{"issue":"1","key":"43_CR11","first-page":"46","volume":"1","author":"Z. Ibrahim","year":"2004","unstructured":"Ibrahim, Z., Tsuboi, Y., Ono, O., Khalid, M.: Direct-Proportional Length-Based DNA Computing for Shortest Path Problem. International Journal of Computer Science and Applications, Vol. 1, Issue 1 (2004) 46\u201360","journal-title":"International Journal of Computer Science and Applications"},{"key":"43_CR12","unstructured":"Udo, F., Sam, S., Wolfgang, B., Hilmar, R.: DNASequenceGenerator: A Program for the Construction of DNA Sequences. Proceedings of the Seventh International Workshop on DNA Based Computers (2001) 23\u201332"}],"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_43.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,23]],"date-time":"2025-01-23T16:08:46Z","timestamp":1737648526000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-32391-0_43"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540250555","9783540323914"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-32391-0_43","relation":{},"subject":[]}}