{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,19]],"date-time":"2025-10-19T06:07:44Z","timestamp":1760854064589,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030227432"},{"type":"electronic","value":"9783030227449"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-22744-9_11","type":"book-chapter","created":{"date-parts":[[2019,6,7]],"date-time":"2019-06-07T17:29:16Z","timestamp":1559928556000},"page":"145-159","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A Self-adaptive Local Search Coordination in Multimeme Memetic Algorithm for Molecular Docking"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7372-7919","authenticated-orcid":false,"given":"Pablo Felipe","family":"Leonhart","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8142-9399","authenticated-orcid":false,"given":"Pedro Henrique","family":"Narloch","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8534-3480","authenticated-orcid":false,"given":"M\u00e1rcio","family":"Dorn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,6,8]]},"reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"Jin, X., Zhihua, C., Wenyin, G.: An adaptive strategy to adjust the components of memetic algorithms. In: 2014 IEEE 26th International Conference on Tools with Artificial Intelligence, pp. 55\u201362, November 2014","DOI":"10.1109\/ICTAI.2014.19"},{"key":"11_CR2","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1016\/j.tips.2014.12.001","volume":"36","author":"YC Chen","year":"2015","unstructured":"Chen, Y.C.: Beware of docking!. Trends Pharmacol. Sci. 36, 78\u201395 (2015)","journal-title":"Trends Pharmacol. Sci."},{"key":"11_CR3","doi-asserted-by":"publisher","first-page":"1277","DOI":"10.1038\/nprot.2013.074","volume":"8","author":"SA Combs","year":"2013","unstructured":"Combs, S.A., et al.: Small-molecule ligand docking into comparative models with Rosetta. Nature Protoc. 8, 1277\u20131298 (2013)","journal-title":"Nature Protoc."},{"key":"11_CR4","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1016\/j.jmb.2008.11.010","volume":"385","author":"IW Davis","year":"2009","unstructured":"Davis, I.W., Baker, D.: Rosettaligand docking with full ligand and receptor flexibility. J. Mol. Biol. 385, 381\u2013392 (2009)","journal-title":"J. Mol. Biol."},{"issue":"2","key":"11_CR5","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1002\/jcc.21334","volume":"31","author":"O Trott","year":"2010","unstructured":"Trott, O., Olson, A.J.: Autodock vina: improving the speed and accuracy of docking with a new scoring function, efficient optimization, and multithreading. J. Comput. Chem. 31(2), 455\u2013461 (2010)","journal-title":"J. Comput. Chem."},{"key":"11_CR6","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1093\/bioinformatics\/btt679","volume":"30","author":"E L\u00f3pez-Camacho","year":"2013","unstructured":"L\u00f3pez-Camacho, E., Godoy, M.J.G., Nebro, A.J., Aldana-Montes, J.F.: jMetalCpp: optimizing molecular docking problems with a C++ metaheuristic framework. Bioinformatics 30, 437\u2013438 (2013)","journal-title":"Bioinformatics"},{"key":"11_CR7","doi-asserted-by":"publisher","first-page":"8","DOI":"10.4172\/2155-9872.1000356","volume":"08","author":"AM Dar","year":"2017","unstructured":"Dar, A.M., Mir, S.: Molecular docking: approaches, types, applications and basic challenges. J. Anal. Bioanal. Tech. 08, 8\u201310 (2017)","journal-title":"J. Anal. Bioanal. Tech."},{"issue":"11","key":"11_CR8","doi-asserted-by":"publisher","first-page":"935","DOI":"10.1038\/nrd1549","volume":"3","author":"DB Kitchen","year":"2004","unstructured":"Kitchen, D.B., Decornez, H., Furr, J.R., Bajorath, J.: Docking and scoring in virtual screening for drug discovery: methods and applications. Nat. Rev. Drug Discov. 3(11), 935\u2013949 (2004)","journal-title":"Nat. Rev. Drug Discov."},{"key":"11_CR9","unstructured":"Rosin, C.D., Halliday, R.S., Hart, W.E., Belew, R.K.: A comparison of global and local search methods in drug docking. In: In Proceedings of the Seventh International Conference on Genetic Algorithms, pp. 221\u2013228. Morgan Kaufmann (1997)"},{"key":"11_CR10","doi-asserted-by":"crossref","unstructured":"Ruiz-Tagle, B., Villalobos-Cid, M., Dorn, M., Inostroza-Ponta, M.: Evaluating the use of local search strategies for a memetic algorithm for the protein-ligand docking problem. In: 2017 36th International Conference of the Chilean Computer Science Society (SCCC), pp. 1\u201312, October 2017","DOI":"10.1109\/SCCC.2017.8405141"},{"key":"11_CR11","first-page":"1","volume":"23","author":"PF Leonhart","year":"2018","unstructured":"Leonhart, P.F., Spieler, E., Braun, R., Dorn, M.: A biased random key genetic algorithm for the proteinligand docking problem. Soft Comput. 23, 1\u201322 (2018)","journal-title":"Soft Comput."},{"key":"11_CR12","unstructured":"Krasnogor, N.: Studies on the theory and design space of memetic algorithms. Ph.D. thesis, University of the West of England (2002)"},{"issue":"3","key":"11_CR13","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s12293-010-0040-9","volume":"2","author":"W Jakob","year":"2010","unstructured":"Jakob, W.: A general cost-benefit-based adaptation framework for multimeme algorithms. Memetic Comput. 2(3), 201\u2013218 (2010)","journal-title":"Memetic Comput."},{"key":"11_CR14","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1016\/j.swevo.2017.10.006","volume":"39","author":"S Dom\u00ednguez-Isidro","year":"2018","unstructured":"Dom\u00ednguez-Isidro, S., Mezura-Montes, E.: A cost-benefit local search coordination in multimeme differential evolution for constrained numerical optimization problems. Swarm Evol. Comput. 39, 249\u2013266 (2018)","journal-title":"Swarm Evol. Comput."},{"key":"11_CR15","unstructured":"Moscato, P.: On evolution, search, optimization, genetic algorithms and martial arts - towards memetic algorithms (1989)"},{"issue":"5","key":"11_CR16","doi-asserted-by":"publisher","first-page":"474","DOI":"10.1109\/TEVC.2005.850260","volume":"9","author":"N Krasnogor","year":"2005","unstructured":"Krasnogor, N., Smith, J.: A tutorial for competent memetic algorithms: model, taxonomy, and design issues. EEE Trans. Evol. Comput. 9(5), 474\u2013488 (2005)","journal-title":"EEE Trans. Evol. Comput."},{"issue":"5","key":"11_CR17","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1007\/s10732-010-9143-1","volume":"17","author":"JF Gon\u00e7alves","year":"2011","unstructured":"Gon\u00e7alves, J.F., Resende, M.G.C.: Biased random-key genetic algorithms for combinatorial optimization. J. Heuristics 17(5), 487\u2013525 (2011)","journal-title":"J. Heuristics"},{"key":"11_CR18","volume-title":"Local Search in Combinatorial Optimization","year":"1997","unstructured":"Aarts, E., Lenstra, J.K. (eds.): Local Search in Combinatorial Optimization, 1st edn. Wiley, New York (1997)","edition":"1"},{"issue":"4598","key":"11_CR19","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: Optimization by simulated annealing. Science 220(4598), 671\u2013680 (1983)","journal-title":"Science"},{"issue":"11","key":"11_CR20","doi-asserted-by":"publisher","first-page":"2201","DOI":"10.1007\/s00500-010-0647-2","volume":"15","author":"D Molina","year":"2011","unstructured":"Molina, D., Lozano, M., S\u00e1nchez, A.M., Herrera, F.: Memetic algorithms based on local search chains for large scale continuous optimisation problems: MA-SSW-Chains. Soft Comput. 15(11), 2201\u20132220 (2011)","journal-title":"Soft Comput."},{"key":"11_CR21","unstructured":"Krasnogor, N., Smith, J.: Emergence of profitable search strategies based on a simple inheritance mechanism (2001)"},{"key":"11_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1007\/11844297_14","volume-title":"Parallel Problem Solving from Nature - PPSN IX","author":"W Jakob","year":"2006","unstructured":"Jakob, W.: Towards an adaptive multimeme algorithm for parameter optimisation suiting the engineers\u2019 needs. In: Runarsson, T.P., Beyer, H.-G., Burke, E., Merelo-Guerv\u00f3s, J.J., Whitley, L.D., Yao, X. (eds.) PPSN 2006. LNCS, vol. 4193, pp. 132\u2013141. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11844297_14"},{"issue":"16","key":"11_CR23","doi-asserted-by":"publisher","first-page":"2785","DOI":"10.1002\/jcc.21256","volume":"30","author":"GM Morris","year":"2009","unstructured":"Morris, G.M., et al.: AutoDock4 and AutoDockTools4: automated docking with selective receptor flexibility. J. Comput. Chem. 30(16), 2785\u20132791 (2009)","journal-title":"J. Comput. Chem."},{"issue":"1","key":"11_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/1758-2946-3-1","volume":"3","author":"NM O\u2019Boyle","year":"2011","unstructured":"O\u2019Boyle, N.M., Banck, M., James, C.A., Morley, C., Vandermeersch, T., Hutchison, G.R.: Open babel: an open chemical toolbox. J. Cheminform. 3(1), 1\u201314 (2011)","journal-title":"J. Cheminform."},{"issue":"3","key":"11_CR25","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1080\/00401706.1964.10490181","volume":"6","author":"OJ Dunn","year":"1964","unstructured":"Dunn, O.J.: Multiple comparisons using rank sums. Technometrics 6(3), 241\u2013252 (1964)","journal-title":"Technometrics"},{"key":"11_CR26","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1016\/j.ins.2014.08.002","volume":"289","author":"CS de Magalh\u00e3es","year":"2014","unstructured":"de Magalh\u00e3es, C.S., Almeida, D.M., Barbosa, H.J.C., Dardenne, L.E.: A dynamic niching genetic algorithm strategy for docking highly flexible ligands. Inf. Sci. 289, 206\u2013224 (2014)","journal-title":"Inf. Sci."}],"container-title":["Lecture Notes in Computer Science","Computational Science \u2013 ICCS 2019"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-22744-9_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,19]],"date-time":"2024-07-19T09:59:48Z","timestamp":1721383188000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-22744-9_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030227432","9783030227449"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-22744-9_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"8 June 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICCS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Faro","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 June 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 June 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccs-computsci2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.iccs-meeting.org\/iccs2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}