{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T14:24:35Z","timestamp":1725805475401},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662450482"},{"type":"electronic","value":"9783662450499"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-45049-9_14","type":"book-chapter","created":{"date-parts":[[2014,9,19]],"date-time":"2014-09-19T06:07:14Z","timestamp":1411106834000},"page":"83-87","source":"Crossref","is-referenced-by-count":0,"title":["Simulation DNA Algorithm"],"prefix":"10.1007","author":[{"given":"Peng","family":"Dai","sequence":"first","affiliation":[]},{"given":"Kang","family":"Zhou","sequence":"additional","affiliation":[]},{"given":"Zhiwei","family":"Wei","sequence":"additional","affiliation":[]},{"given":"Di","family":"Hu","sequence":"additional","affiliation":[]},{"given":"Chun","family":"Liu","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"14_CR1","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1016\/j.jalgor.2004.04.012","volume":"54","author":"S. Rainer","year":"2005","unstructured":"Rainer, S.: An algorithm for the satisfiability problem of formulas in conjunctive normal form. Journal of Algorithms\u00a054, 40\u201344 (2005)","journal-title":"Journal of Algorithms"},{"key":"14_CR2","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1016\/j.tcs.2008.03.013","volume":"404","author":"F. Ivancie","year":"2008","unstructured":"Ivancie, F., Yang, Z., Ganai, M.K.: Effident SAT-based bounded model checking for software verifications. Theoretical Computer Science\u00a0404, 256\u2013274 (2008)","journal-title":"Theoretical Computer Science"},{"key":"14_CR3","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/j.artint.2012.08.001","volume":"193","author":"R. Jussi","year":"2012","unstructured":"Jussi, R.: Planning as satisfiability: Heuristics. Artificial Intelligence\u00a0193, 45\u201386 (2012)","journal-title":"Artificial Intelligence"},{"key":"14_CR4","doi-asserted-by":"publisher","first-page":"2176","DOI":"10.1016\/j.procs.2011.04.238","volume":"4","author":"T. Cui","year":"2011","unstructured":"Cui, T., Franchetti, F.: Autotuning a random walk boolean satisfiability solver. Procedia Computer Science\u00a04, 2176\u20132185 (2011)","journal-title":"Procedia Computer Science"},{"key":"14_CR5","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1016\/j.asoc.2009.07.012","volume":"10","author":"K. Yousef","year":"2010","unstructured":"Yousef, K.: Comparing the performance of the genetic and local search algorithms for solving the satisfiability problems. Applied Soft Computing\u00a010, 198\u2013207 (2010)","journal-title":"Applied Soft Computing"},{"key":"14_CR6","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1360\/csb2004-49-3-205","volume":"49","author":"J. Xu","year":"2004","unstructured":"Xu, J., Dong, Y.F., Wei, X.P.: Sticker DNA computer model-Part I:Theory. Chinese Science Bulletin\u00a049, 205\u2013212 (2004)","journal-title":"Chinese Science Bulletin"},{"key":"14_CR7","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1360\/csb2004-49-3-229","volume":"49","author":"J. Xu","year":"2004","unstructured":"Xu, J., Li, S.P., Dong, Y.F., Wei, X.P.: Sticker DNA computer model-Part II: application. Chinese Science Bulletin\u00a049, 229\u2013307 (2004)","journal-title":"Chinese Science Bulletin"},{"key":"14_CR8","doi-asserted-by":"publisher","first-page":"139","DOI":"10.12785\/amis\/080117","volume":"8","author":"K. Zhou","year":"2014","unstructured":"Zhou, K., Chen, J.: Simulation DNA algorithm of set covering problem. Applied Mathematics and Information Sciences\u00a08, 139\u2013144 (2014)","journal-title":"Applied Mathematics and Information Sciences"},{"key":"14_CR9","first-page":"24","volume":"37","author":"K. Zhou","year":"2009","unstructured":"Zhou, K., Wei, C.J., Liu, S., Lu, J.: Simulation DNA algorithm of all solutions of Eight Queens Problem. Journal of Huazhong University of Science and Technology (Natural Science Edition)\u00a037, 24\u201327 (2009)","journal-title":"Journal of Huazhong University of Science and Technology (Natural Science Edition)"},{"key":"14_CR10","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/S0166-218X(02)00409-2","volume":"130","author":"D.A. Plaisted","year":"2003","unstructured":"Plaisted, D.A., Biere, A., Zhu, Y.S.: A satisfiability procedure for quantified boolean formulae. Discrete Applied Mathematics\u00a0130, 291\u2013328 (2003)","journal-title":"Discrete Applied Mathematics"}],"container-title":["Communications in Computer and Information Science","Bio-Inspired Computing - Theories and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-45049-9_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,24]],"date-time":"2020-08-24T13:31:46Z","timestamp":1598275906000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-45049-9_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662450482","9783662450499"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-45049-9_14","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2014]]}}}