{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:15:16Z","timestamp":1725560116815},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540283256"},{"type":"electronic","value":"9783540318583"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11539117_159","type":"book-chapter","created":{"date-parts":[[2010,7,20]],"date-time":"2010-07-20T22:10:45Z","timestamp":1279663845000},"page":"1182-1191","source":"Crossref","is-referenced-by-count":4,"title":["DNA Computing for Complex Scheduling Problem"],"prefix":"10.1007","author":[{"given":"Mohd Saufee","family":"Muhammad","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zuwairie","family":"Ibrahim","sequence":"additional","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":"Marzuki","family":"Khalid","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"159_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":"159_CR2","doi-asserted-by":"crossref","unstructured":"Adleman, L.M.: Computing with DNA. Scientific American, 34\u201341 (1998)","DOI":"10.1038\/scientificamerican0898-54"},{"key":"159_CR3","unstructured":"Narayanan, A., Zorbalas, S.: DNA Algorithms for Computing Shortest Paths. In: Proceedings of Genetic Programming, pp. 718\u2013723 (1998)"},{"key":"159_CR4","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\u00a02, 447\u2013455 (2002)","journal-title":"International Journal of Computational Intelligence and Applications"},{"key":"159_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/3-540-36440-4_7","volume-title":"DNA Computing","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. In: Hagiya, M., Ohuchi, A. (eds.) DNA 2002. LNCS, vol.\u00a02568, pp. 73\u201384. Springer, Heidelberg (2003)"},{"issue":"1","key":"159_CR6","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\u00a01(1), 46\u201360 (2004)","journal-title":"International Journal of Computer Science and Applications"},{"key":"159_CR7","doi-asserted-by":"crossref","unstructured":"Fitch, J.P.: Engineering Introduction to Biotechnology. SPIE Press (2001)","DOI":"10.1117\/3.449265"},{"key":"159_CR8","unstructured":"Zucca, M.: DNA Based Computational Models. PhD Thesis, Politecnico Di Torino, Italy (2000)"},{"key":"159_CR9","doi-asserted-by":"publisher","first-page":"10747","DOI":"10.1073\/pnas.91.22.10747","volume":"91","author":"W.P. Stemmer","year":"1994","unstructured":"Stemmer, W.P.: DNA Shuffling by Random Fragmentation and Reassembly: In Vitro Recombination for Molecular Evolution. Proc. Natl. Acad. Sci. U.S.A.\u00a091, 10747\u201310751 (1994)","journal-title":"Proc. Natl. Acad. Sci. U.S.A."},{"issue":"3","key":"159_CR10","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1006\/jtbi.1997.0475","volume":"188","author":"P.D. Kaplan","year":"1997","unstructured":"Kaplan, P.D., Ouyang, Q., Thaler, D.S., Libchaber, A.: Parallel Overlap Assembly for the Construction of Computational DNA Libraries. Journal of Theoretical Biology\u00a0188(3), 333\u2013341 (1997)","journal-title":"Journal of Theoretical Biology"},{"key":"159_CR11","unstructured":"Lee, J.Y., Lim, H.W., Yoo, S.I., Zhang, B.T., Park, T.H.: Efficient Initial Pool Generation for Weighted Graph Problems Using Parallel Overlap Assembly. In: Preliminary Proceeding of the 10th International Meeting on DNA Computing, pp. 357\u2013364 (2004)"},{"key":"159_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1007\/3-540-48523-6_9","volume-title":"Automata, Languages and Programming","author":"G. Paun","year":"1999","unstructured":"Paun, G., Rozenberg, G., Salomaa, A.: DNA Computing: New Computing Paradigms. In: Wiedermann, J., Van Emde Boas, P., Nielsen, M. (eds.) ICALP 1999. LNCS, vol.\u00a01644, pp. 106\u2013118. Springer, Heidelberg (1999)"},{"key":"159_CR13","unstructured":"Amos, M.: DNA Computation. PhD Thesis, The University of Warwick, UK (1997)"},{"issue":"3","key":"159_CR14","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/BF03037359","volume":"20","author":"Y. Yamamoto","year":"2002","unstructured":"Yamamoto, Y., Kameda, A., Matsuura, N., Shiba, T., Kawazoe, Y., Ahochi, A.: A Separation Method for DNA Computing Based on Concentration Control. New Generation Computing\u00a020(3), 251\u2013262 (2002)","journal-title":"New Generation Computing"},{"key":"159_CR15","doi-asserted-by":"crossref","unstructured":"Udo, F., Sam, S., Wolfgang, B., Hilmar, R.: DNASequenceGenerator: A Program for the Construction of DNA Sequences. In: Proceedings of the Seventh International Workshop on DNA Based Computers, pp. 23\u201332 (2001)","DOI":"10.1007\/3-540-48017-X_3"}],"container-title":["Lecture Notes in Computer Science","Advances in Natural Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11539117_159.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:15:37Z","timestamp":1605644137000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11539117_159"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540283256","9783540318583"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/11539117_159","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}