{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:57:24Z","timestamp":1725487044480},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642371882"},{"type":"electronic","value":"9783642371899"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-37189-9_17","type":"book-chapter","created":{"date-parts":[[2013,2,25]],"date-time":"2013-02-25T02:55:52Z","timestamp":1361760952000},"page":"188-199","source":"Crossref","is-referenced-by-count":6,"title":["Impact of Different Recombination Methods in a Mutation-Specific MOEA for a Biochemical Application"],"prefix":"10.1007","author":[{"given":"Susanne","family":"Rosenthal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nail","family":"El-Sourani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Markus","family":"Borschbach","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"6","key":"17_CR1","doi-asserted-by":"publisher","first-page":"2462","DOI":"10.1021\/ci6005646","volume":"47","author":"M.J. Vainio","year":"2007","unstructured":"Vainio, M.J., Johnson, M.S.: Generating conformer ensembles using a multiobjective genetic algorithm. J. Chem. Inf. Model.\u00a047(6), 2462\u20132474 (2007)","journal-title":"J. Chem. Inf. Model."},{"issue":"3","key":"17_CR2","first-page":"316","volume":"10","author":"C.A. Nicolaou","year":"2007","unstructured":"Nicolaou, C.A., Brown, N., Pattichis, C.S.: Molecular optimization using computational multi-objective methods. Drug Discovery & Development\u00a010(3), 316\u2013324 (2007)","journal-title":"Drug Discovery & Development"},{"key":"17_CR3","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1186\/1471-2105-12-241","volume":"12","author":"B. Knapp","year":"2011","unstructured":"Knapp, B., Gicziv, V., Ribarics, R.: PeptX: Using genetic algorithms to optimize peptides for MHC binding. BMC Bioinformatics 12, 241 (2011)","journal-title":"BMC Bioinformatics"},{"issue":"3","key":"17_CR4","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1162\/evco.1994.2.3.221","volume":"2","author":"N. Srinivas","year":"1994","unstructured":"Srinivas, N., Deb, K.: Multiobjective optimization using nondominated sorting in genetic algorithms. J. Evol. Comput.\u00a02(3), 221\u2013248 (1994)","journal-title":"J. Evol. Comput."},{"issue":"2","key":"17_CR5","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"K. Deb","year":"2002","unstructured":"Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.: A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans. Evol. Comput.\u00a06(2), 182\u2013197 (2002)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"17_CR6","unstructured":"Zitzler, E., Thiele, L.: An evolutionary algorithm for multiobjective optimization: The strength Pareto approach. Technical report 43, Computer engineering and Networks Laboratory (TIK), Swiss Federal Institute of Technology, ETH (1999)"},{"key":"17_CR7","unstructured":"Zitzler, E., Laumann, M., Thiele, L.: Improving the strength pareto evolutionary algorithm. Technical report 103, Computer engineering and Networks Laboratory (TIK), Swiss Federal Institute of Technology (ETH), Zurich (2001)"},{"issue":"1-3","key":"17_CR8","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/j.dam.2004.02.019","volume":"149","author":"T. Jansen","year":"2005","unstructured":"Jansen, T., Wegener, I.: Real royal road functions - where crossover probably is essential. Discrete Applied Mathematics\u00a0149(1-3), 111\u2013125 (2005)","journal-title":"Discrete Applied Mathematics"},{"issue":"1","key":"17_CR9","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/s00453-002-0940-2","volume":"34","author":"T. Jansen","year":"2002","unstructured":"Jansen, T., Wegener, I.: The analysis of evolutionary algorithms - a proof that crossover really can help. Algorithmica\u00a034(1), 47\u201366 (2002)","journal-title":"Algorithmica"},{"key":"17_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"667","DOI":"10.1007\/978-3-642-15844-5_67","volume-title":"Parallel Problem Solving from Nature, PPSN XI","author":"F. Neumann","year":"2010","unstructured":"Neumann, F., Theile, M.: How Crossover Speeds Up Evolutionary Algorithms for the Multi-criteria All-Pairs-Shortest-Path Problem. In: Schaefer, R., Cotta, C., Ko\u0142odziej, J., Rudolph, G. (eds.) PPSN XI, Part I. LNCS, vol.\u00a06238, pp. 667\u2013676. Springer, Heidelberg (2010)"},{"key":"17_CR11","unstructured":"Deb, K., Anand, A., Joshi, D.: A computationally Efficient Evolutionary Algorithm for Real Parameter Optimization, KanGAL report: 2002003"},{"key":"17_CR12","unstructured":"Ono, I., Kobayashi, S.: A real-coded genetic algorithm for functional optimization using unimodal normal distribution crossover. In: Proceedings of the 7th International Conference on Genetic Algorithms (ICGA-7), pp. 246\u2013253 (1997)"},{"key":"17_CR13","unstructured":"Tsusui, S., Yamamura, M., Higuchi, T.: Multi-parent recombination with simplex crossover in real-coded genetic algorithms. In: Proceedings of the Genetic and Evolutionary Computing Conference (GECCO 1999), pp. 657\u2013664 (1999)"},{"key":"17_CR14","doi-asserted-by":"crossref","unstructured":"Eshelman, L.J., Schaffer, J.D.: Real-coded genetic algorithms and interval schemata. In: Whitley, D. (ed.) Foundation of Genetic Algorithm II, pp. 187\u2013202 (1993)","DOI":"10.1016\/B978-0-08-094832-4.50018-0"},{"key":"17_CR15","first-page":"115","volume":"9","author":"K. Deb","year":"1995","unstructured":"Deb, K., Agrawal, R.B.: Simulated binary crossover for continuous search space. Complex System\u00a09, 115\u2013148 (1995)","journal-title":"Complex System"},{"key":"17_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1007\/978-3-642-34859-4_16","volume-title":"Simulated Evolution and Learning","author":"S. Rosenthal","year":"2012","unstructured":"Rosenthal, S., El-Sourani, N., Borschbach, M.: Introduction of a Mutation Specific Fast Non-dominated Sorting GA Evolved for Biochemical Optimizations. In: Bui, L.T., Ong, Y.S., Hoai, N.X., Ishibuchi, H., Suganthan, P.N. (eds.) SEAL 2012. LNCS, vol.\u00a07673, pp. 158\u2013167. Springer, Heidelberg (2012)"},{"issue":"2","key":"17_CR17","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"K. Deb","year":"2002","unstructured":"Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.: A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans. Evol. Comput.\u00a06(2), 182\u2013197 (2002)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"2","key":"17_CR18","first-page":"324","volume":"12","author":"M. Borschbach","year":"2005","unstructured":"Borschbach, M.: Neural classification of biological properties and genetic operators configuration issues. Trans. on Information Science\u00a012(2), 324\u2013329 (2005) ISSN: 1790-0832","journal-title":"Trans. on Information Science"},{"key":"17_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1007\/3-540-61286-6_141","volume-title":"Foundations of Intelligent Systems","author":"T. B\u00e4ck","year":"1996","unstructured":"B\u00e4ck, T., Sch\u00fctz, M.: Intelligent Mutation Rate Control in Canonical Genetic Algorithms. In: Michalewicz, M., Ra\u015b, Z.W. (eds.) ISMIS 1996. LNCS, vol.\u00a01079, pp. 158\u2013167. Springer, Heidelberg (1996)"},{"key":"17_CR20","unstructured":"BioJava: CookBook, release 3.0, \n                    \n                      http:\/\/www.biojava.org\/wiki\/BioJava"},{"issue":"3","key":"17_CR21","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1016\/0022-2836(70)90057-4","volume":"48","author":"S.B. Needleman","year":"1970","unstructured":"Needleman, S.B., Wunsch, C.D.: A general method applicable to the search for similarities in the amino acid sequence of two proteins. Journal of Molecular Biology\u00a048(3), 443\u2013453 (1970)","journal-title":"Journal of Molecular Biology"},{"key":"17_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1007\/BFb0056872","volume-title":"Parallel Problem Solving from Nature - PPSN V","author":"E. Zitzler","year":"1998","unstructured":"Zitzler, E., Thiele, L.: Multiobjective Optimization Using Evolutionary Algorithms - A Comparative Case Study. In: Eiben, A.E., B\u00e4ck, T., Schoenauer, M., Schwefel, H.-P. (eds.) PPSN 1998. LNCS, vol.\u00a01498, pp. 292\u2013301. Springer, Heidelberg (1998)"},{"key":"17_CR23","unstructured":"Deb, K., Joshi, D., Anand, A.: Real-coded evolutionary algorithms with parent-centric recombination. KanGAL Report No. 2001003 (2001)"},{"key":"17_CR24","doi-asserted-by":"crossref","unstructured":"R\u00f6ckendorf, N., Borschbach, M., Frey, A.: Molecular evolution of peptide ligands with custom-tailored characteristics. PLOS Computational Biology (December 2012), open access journal","DOI":"10.1371\/journal.pcbi.1002800"},{"key":"17_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"442","DOI":"10.1007\/978-3-642-15871-1_45","volume-title":"Parallel Problem Solving from Nature, PPSN XI","author":"N. El-Sourani","year":"2010","unstructured":"El-Sourani, N., Borschbach, M.: Design and Comparison of two Evolutionary Approaches for Solving the Rubik\u2019s Cube. In: Schaefer, R., Cotta, C., Ko\u0142odziej, J., Rudolph, G. (eds.) PPSN XI, Part II. LNCS, vol.\u00a06239, pp. 442\u2013451. Springer, Heidelberg (2010)"},{"issue":"3","key":"17_CR26","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1162\/evco.1997.5.3.347","volume":"5","author":"A.E. Eiben","year":"1997","unstructured":"Eiben, A.E., B\u00e4ck, T.: Empirical investigation of multiparent recombination operators in evolutionary strategies. Evolutionary Computation\u00a05(3), 347\u2013365 (1997)","journal-title":"Evolutionary Computation"},{"key":"17_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/978-3-642-17298-4_38","volume-title":"Simulated Evolution and Learning","author":"M. Borschbach","year":"2010","unstructured":"Borschbach, M., Grelle, C., Hauke, S.: Divide and Evolve Driven by Human Strategies. In: Deb, K., Bhattacharya, A., Chakraborti, N., Chakroborty, P., Das, S., Dutta, J., Gupta, S.K., Jain, A., Aggarwal, V., Branke, J., Louis, S.J., Tan, K.C. (eds.) SEAL 2010. LNCS, vol.\u00a06457, pp. 369\u2013373. Springer, Heidelberg (2010)"}],"container-title":["Lecture Notes in Computer Science","Evolutionary Computation, Machine Learning and Data Mining in Bioinformatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-37189-9_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,11]],"date-time":"2019-05-11T11:17:03Z","timestamp":1557573423000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-37189-9_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642371882","9783642371899"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-37189-9_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}