{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T18:13:43Z","timestamp":1648577623767},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2008,10,26]],"date-time":"2008-10-26T00:00:00Z","timestamp":1224979200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc\/2.0"},{"start":{"date-parts":[[2008,10,26]],"date-time":"2008-10-26T00:00:00Z","timestamp":1224979200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc\/2.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Nat Comput"],"published-print":{"date-parts":[[2010,3]]},"DOI":"10.1007\/s11047-008-9106-8","type":"journal-article","created":{"date-parts":[[2008,10,25]],"date-time":"2008-10-25T04:01:22Z","timestamp":1224907282000},"page":"283-294","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["When to use bit-wise neutrality"],"prefix":"10.1007","volume":"9","author":[{"given":"Tobias","family":"Friedrich","sequence":"first","affiliation":[]},{"given":"Frank","family":"Neumann","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2008,10,26]]},"reference":[{"key":"9106_CR1","doi-asserted-by":"crossref","unstructured":"Collins M (2005) Finding needles in haystacks is harder with neutrality. In: Proceedings of the annual conference on genetic and evolutionary computation (GECCO \u201905). ACM Press, pp 1613\u20131618","DOI":"10.1145\/1068009.1068282"},{"issue":"2","key":"9106_CR2","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1162\/evco.1998.6.2.185","volume":"6","author":"S Droste","year":"1998","unstructured":"Droste S, Jansen T, Wegener I (1998) A rigorous complexity analysis of the (1\u00a0+\u00a01) evolutionary algorithm for separable functions with boolean inputs. Evol Comput 6(2):185\u2013196","journal-title":"Evol Comput"},{"key":"9106_CR3","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/S0304-3975(01)00182-7","volume":"276","author":"S Droste","year":"2002","unstructured":"Droste S, Jansen T, Wegener I (2002) On the analysis of the (1\u00a0+\u00a01) evolutionary algorithm. Theor Comput Sci 276:51\u201381","journal-title":"Theor Comput Sci"},{"issue":"2","key":"9106_CR4","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1162\/evco.1999.7.2.173","volume":"7","author":"J Garnier","year":"1999","unstructured":"Garnier J, Kallel L, Schoenauer M (1999) Rigorous hitting times for binary mutations. Evol Comput 7(2):173\u2013203","journal-title":"Evol Comput"},{"issue":"3","key":"9106_CR5","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/s11009-007-9047-1","volume":"10","author":"WJ Gutjahr","year":"2008","unstructured":"Gutjahr WJ, Sebastiani G (2008) Runtime analysis of ant colony optimization with best-so-far reinforcement. Methodol Comput Appl Probab 10(3):409\u2013433","journal-title":"Methodol Comput Appl Probab"},{"issue":"1","key":"9106_CR6","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/S0004-3702(01)00058-3","volume":"127","author":"J He","year":"2001","unstructured":"He J, Yao X (2001) Drift analysis and average time complexity of evolutionary algorithms. Artif Intell 127(1):57\u201385","journal-title":"Artif Intell"},{"key":"9106_CR7","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/BF02338823","volume":"43","author":"MA Huynen","year":"1996","unstructured":"Huynen MA (1996) Exploring phenotype space through neutral evolution. J Mol Evol 43:165\u2013169","journal-title":"J Mol Evol"},{"key":"9106_CR8","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1073\/pnas.93.1.397","volume":"93","author":"MA Huynen","year":"1996","unstructured":"Huynen MA, Stadler P, Fontana W (1996) Smoothness within ruggedness: the role of neutrality in adaptation. Proc Natl Acad Sci USA 93:397\u2013401","journal-title":"Proc Natl Acad Sci USA"},{"issue":"6","key":"9106_CR9","doi-asserted-by":"publisher","first-page":"589","DOI":"10.1109\/4235.974841","volume":"5","author":"T Jansen","year":"2001","unstructured":"Jansen T, Wegener I (2001) Evolutionary algorithms\u2014how to cope with plateaus of constant fitness and when to reject strings of the same fitness. IEEE Trans Evol Comput 5(6):589\u2013599","journal-title":"IEEE Trans Evol Comput"},{"key":"9106_CR10","doi-asserted-by":"publisher","first-page":"624","DOI":"10.1038\/217624a0","volume":"217","author":"M Kimura","year":"1968","unstructured":"Kimura M (1968) Evolutionary rate at the molecular level. Nature 217:624\u2013626","journal-title":"Nature"},{"key":"9106_CR11","doi-asserted-by":"crossref","unstructured":"Neumann F, Sudholt D, Witt C (2007) Comparing variants of MMAS ACO algorithms on pseudo-boolean functions. In: Proceedings of engineering stochastic local search algorithms (SLS \u201907), LNCS, vol 4638. Springer, pp 61\u201375","DOI":"10.1007\/978-3-540-74446-7_5"},{"key":"9106_CR12","doi-asserted-by":"crossref","unstructured":"Poli R, L\u00f3pez EG (2007) On the effects of bit-wise neutrality on fitness distance correlation, phenotypic mutation rates and problem hardness. In: Proceedings of foundations of genetic algorithms (FOGA \u201907), pp. 138\u2013164","DOI":"10.1007\/978-3-540-73482-6_9"},{"key":"9106_CR13","doi-asserted-by":"crossref","unstructured":"Rothlauf F (2003) Population sizing for the redundant trivial voting mapping. In: Proceedings of the annual conference on genetic and evolutionary computation (GECCO \u201903), LNCS, vol 2724. Springer, pp 618\u2013627","DOI":"10.1007\/3-540-45110-2_6"},{"key":"9106_CR14","unstructured":"Schuster P (2002) Molecular insights into evolution of phenotypes. In: Crutchfield JP, Schuster P (eds) Evolutionary dynamics\u2014exploring the interplay of accident, selection, neutrality and function. Santa Fe Institute Series in the Science of Complexity. Oxford University Press, Oxford"},{"key":"9106_CR15","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1007\/PL00006483","volume":"48","author":"C Stephens","year":"1999","unstructured":"Stephens C, Waelbroeck H (1999) Codon bias and mutability in HIV sequences. J Mol Evol 48:390\u2013397","journal-title":"J Mol Evol"},{"issue":"2","key":"9106_CR16","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1023\/A:1024906105255","volume":"2","author":"M Toussaint","year":"2003","unstructured":"Toussaint M, Igel C (2003) Neutrality and self-adaptation. Nat Comput 2(2):117\u2013132","journal-title":"Nat Comput"},{"key":"9106_CR17","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1017\/S0963548304006650","volume":"14","author":"I Wegener","year":"2005","unstructured":"Wegener I, Witt C (2005) On the optimization of monotone polynomials by simple randomized search heuristics. Combin Probab Comput 14:225\u2013247","journal-title":"Combin Probab Comput"},{"key":"9106_CR18","doi-asserted-by":"crossref","unstructured":"Weicker K, Weicker N (2001) Burden and benefits of redundancy. In: Proceedings of foundations of genetic algorithms (FOGA \u201900). Morgan Kaufmann, pp 313\u2013333","DOI":"10.1016\/B978-155860734-7\/50100-1"}],"container-title":["Natural Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11047-008-9106-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11047-008-9106-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11047-008-9106-8.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11047-008-9106-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,31]],"date-time":"2021-08-31T20:13:11Z","timestamp":1630440791000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11047-008-9106-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,10,26]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2010,3]]}},"alternative-id":["9106"],"URL":"https:\/\/doi.org\/10.1007\/s11047-008-9106-8","relation":{},"ISSN":["1567-7818","1572-9796"],"issn-type":[{"value":"1567-7818","type":"print"},{"value":"1572-9796","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,10,26]]},"assertion":[{"value":"7 February 2008","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 October 2008","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 October 2008","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}