{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,3]],"date-time":"2026-04-03T04:40:55Z","timestamp":1775191255864,"version":"3.50.1"},"reference-count":58,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,1,15]],"date-time":"2022-01-15T00:00:00Z","timestamp":1642204800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,1,15]],"date-time":"2022-01-15T00:00:00Z","timestamp":1642204800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100003130","name":"Fonds Wetenschappelijk Onderzoek","doi-asserted-by":"publisher","award":["39461"],"award-info":[{"award-number":["39461"]}],"id":[{"id":"10.13039\/501100003130","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Cheminform"],"published-print":{"date-parts":[[2022,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Given an objective function that predicts key properties of a molecule, goal-directed de novo molecular design is a useful tool to identify molecules that maximize or minimize said objective function. Nonetheless, a common drawback of these methods is that they tend to design synthetically unfeasible molecules. In this paper we describe a Lamarckian evolutionary algorithm for de novo drug design (LEADD). LEADD attempts to strike a balance between optimization power, synthetic accessibility of designed molecules and computational efficiency. To increase the likelihood of designing synthetically accessible molecules, LEADD represents molecules as graphs of molecular fragments, and limits the bonds that can be formed between them through knowledge-based pairwise atom type compatibility rules. A reference library of drug-like molecules is used to extract fragments, fragment preferences and compatibility rules. A novel set of genetic operators that enforce these rules in a computationally efficient manner is presented. To sample chemical space more efficiently we also explore a Lamarckian evolutionary mechanism that adapts the reproductive behavior of molecules. LEADD has been compared to both standard virtual screening and a comparable evolutionary algorithm using a standardized benchmark suite and was shown to be able to identify fitter molecules more efficiently. Moreover, the designed molecules are predicted to be easier to synthesize than those designed by other evolutionary algorithms.<\/jats:p><jats:p><jats:bold>Graphical Abstract<\/jats:bold><\/jats:p>","DOI":"10.1186\/s13321-022-00582-y","type":"journal-article","created":{"date-parts":[[2022,1,15]],"date-time":"2022-01-15T11:02:33Z","timestamp":1642244553000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":30,"title":["LEADD: Lamarckian evolutionary algorithm for de novo drug design"],"prefix":"10.1186","volume":"14","author":[{"given":"Alan","family":"Kerstjens","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4450-7677","authenticated-orcid":false,"given":"Hans","family":"De Winter","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,1,15]]},"reference":[{"key":"582_CR1","doi-asserted-by":"publisher","first-page":"2324","DOI":"10.1021\/acs.jcim.5b00559","volume":"55","author":"T Sterling","year":"2015","unstructured":"Sterling T, Irwin JJ (2015) ZINC 15\u2014ligand discovery for everyone. J Chem Inf Model 55:2324\u20132337. https:\/\/doi.org\/10.1021\/acs.jcim.5b00559","journal-title":"J Chem Inf Model"},{"key":"582_CR2","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1021\/co300096q","volume":"14","author":"Q Hu","year":"2012","unstructured":"Hu Q, Peng Z, Sutton SC et al (2012) Pfizer global virtual library (PGVL): a chemistry design tool powered by experimentally validated parallel synthesis information. ACS Comb Sci 14:579\u2013589. https:\/\/doi.org\/10.1021\/co300096q","journal-title":"ACS Comb Sci"},{"key":"582_CR3","doi-asserted-by":"publisher","first-page":"1824","DOI":"10.1021\/acs.jcim.5b00203","volume":"55","author":"F Chevillard","year":"2015","unstructured":"Chevillard F, Kolb P (2015) SCUBIDOO: a Large yet screenable and easily searchable database of computationally created chemical compounds optimized toward high likelihood of synthetic tractability. J Chem Inf Model 55:1824\u20131835. https:\/\/doi.org\/10.1021\/acs.jcim.5b00203","journal-title":"J Chem Inf Model"},{"key":"582_CR4","doi-asserted-by":"publisher","first-page":"2864","DOI":"10.1021\/ci300415d","volume":"52","author":"L Ruddigkeit","year":"2012","unstructured":"Ruddigkeit L, Van Deursen R, Blum LC, Reymond JL (2012) Enumeration of 166 billion organic small molecules in the chemical universe database GDB-17. J Chem Inf Model 52:2864\u20132875. https:\/\/doi.org\/10.1021\/ci300415d","journal-title":"J Chem Inf Model"},{"key":"582_CR5","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1002\/chin.200321198","volume":"34","author":"P Ertl","year":"2003","unstructured":"Ertl P (2003) Cheminformatics analysis of organic substituents: identification of the most common substituents, calculation of substituent properties, and automatic identification of drug-like bioisosteric groups. J Chem Inf Comput Sci 34:374\u2013380. https:\/\/doi.org\/10.1002\/chin.200321198","journal-title":"J Chem Inf Comput Sci"},{"key":"582_CR6","doi-asserted-by":"publisher","first-page":"675","DOI":"10.1007\/s10822-013-9672-4","volume":"27","author":"PG Polishchuk","year":"2013","unstructured":"Polishchuk PG, Madzhidov TI, Varnek A (2013) Estimation of the size of drug-like chemical space based on GDB-17 data. J Comput Aided Mol Des 27:675\u2013679. https:\/\/doi.org\/10.1007\/s10822-013-9672-4","journal-title":"J Comput Aided Mol Des"},{"key":"582_CR7","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1002\/(SICI)1098-1128(199601)16:1<3::AID-MED1>3.0.CO;2-6","volume":"16","author":"RS Bohacek","year":"1996","unstructured":"Bohacek RS, McMartin C, Guida WC (1996) The art and practice of structure-based drug design: a molecular modeling perspective. Med Res Rev 16:3\u201350. https:\/\/doi.org\/10.1002\/(SICI)1098-1128(199601)16:1%3c3::AID-MED1%3e3.0.CO;2-6","journal-title":"Med Res Rev"},{"key":"582_CR8","doi-asserted-by":"publisher","first-page":"4443","DOI":"10.1021\/acs.jmedchem.5b01409","volume":"59","author":"DG Brown","year":"2016","unstructured":"Brown DG, Bostr\u00f6m J (2016) Analysis of past and present synthetic methodologies on medicinal chemistry: where have all the new reactions gone? J Med Chem 59:4443\u20134458. https:\/\/doi.org\/10.1021\/acs.jmedchem.5b01409","journal-title":"J Med Chem"},{"key":"582_CR9","doi-asserted-by":"publisher","first-page":"4385","DOI":"10.1021\/acs.jmedchem.6b00153","volume":"59","author":"N Schneider","year":"2016","unstructured":"Schneider N, Lowe DM, Sayle RA et al (2016) Big data from pharmaceutical patents: a computational analysis of medicinal chemists bread and butter. J Med Chem 59:4385\u20134402. https:\/\/doi.org\/10.1021\/acs.jmedchem.6b00153","journal-title":"J Med Chem"},{"key":"582_CR10","doi-asserted-by":"publisher","first-page":"7296","DOI":"10.1021\/ja401184g","volume":"135","author":"AM Virshup","year":"2013","unstructured":"Virshup AM, Contreras-Garc\u00eda J, Wipf P et al (2013) Stochastic voyages into uncharted chemical space produce a representative library of all possible drug-like compounds. J Am Chem Soc 135:7296\u20137303. https:\/\/doi.org\/10.1021\/ja401184g","journal-title":"J Am Chem Soc"},{"key":"582_CR11","doi-asserted-by":"publisher","first-page":"540","DOI":"10.1002\/cmdc.201700561","volume":"13","author":"A Lin","year":"2018","unstructured":"Lin A, Horvath D, Afonina V et al (2018) Mapping of the available chemical space versus the chemical universe of lead-like compounds. ChemMedChem 13:540\u2013554. https:\/\/doi.org\/10.1002\/cmdc.201700561","journal-title":"ChemMedChem"},{"key":"582_CR12","doi-asserted-by":"publisher","first-page":"649","DOI":"10.1038\/nrd1799","volume":"4","author":"G Schneider","year":"2005","unstructured":"Schneider G, Fechner U (2005) Computer-based de novo design of drug-like molecules. Nat Rev Drug Discov 4:649\u2013663. https:\/\/doi.org\/10.1038\/nrd1799","journal-title":"Nat Rev Drug Discov"},{"key":"582_CR13","doi-asserted-by":"publisher","first-page":"1096","DOI":"10.1021\/acs.jcim.8b00839","volume":"59","author":"N Brown","year":"2019","unstructured":"Brown N, Fiscato M, Segler MHS, Vaucher AC (2019) GuacaMol: benchmarking models for de novo molecular design. J Chem Inf Model 59:1096\u20131108. https:\/\/doi.org\/10.1021\/acs.jcim.8b00839","journal-title":"J Chem Inf Model"},{"key":"582_CR14","doi-asserted-by":"publisher","first-page":"5714","DOI":"10.1021\/acs.jcim.0c00174","volume":"60","author":"W Gao","year":"2020","unstructured":"Gao W, Coley CW (2020) The synthesizability of molecules proposed by generative models. J Chem Inf Model 60:5714\u20135723. https:\/\/doi.org\/10.1021\/acs.jcim.0c00174","journal-title":"J Chem Inf Model"},{"key":"582_CR15","doi-asserted-by":"publisher","first-page":"1700","DOI":"10.1021\/jm00064a003","volume":"36","author":"SH Rotstein","year":"1993","unstructured":"Rotstein SH, Murcko MA (1993) GroupBuild: a fragment-based method for de novo drug design. J Med Chem 36:1700\u20131710","journal-title":"J Med Chem"},{"key":"582_CR16","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/BF00124408","volume":"9","author":"RC Glen","year":"1995","unstructured":"Glen RC, Payne AWR (1995) A genetic algorithm for the automated generation of molecules within constraints. J Comput Aided Mol Des 9:181\u2013202. https:\/\/doi.org\/10.1007\/BF00124408","journal-title":"J Comput Aided Mol Des"},{"key":"582_CR17","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/BF02174466","volume":"3","author":"VJ Gillet","year":"1995","unstructured":"Gillet VJ, Myatt G, Zsoldos Z, Johnson AP (1995) SPROUT, HIPPO and CAESA: tools for de novo structure generation and estimation of synthetic accessibility. Perspect Drug Discov Des 3:34\u201350. https:\/\/doi.org\/10.1007\/BF02174466","journal-title":"Perspect Drug Discov Des"},{"key":"582_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/1758-2946-1-8","volume":"1","author":"P Ertl","year":"2009","unstructured":"Ertl P, Schuffenhauer A (2009) Estimation of synthetic accessibility score of drug-like molecules based on molecular complexity and fragment contributions. J Cheminform 1:1\u201311. https:\/\/doi.org\/10.1186\/1758-2946-1-8","journal-title":"J Cheminform"},{"key":"582_CR19","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1186\/s13321-020-00439-2","volume":"12","author":"M Vor\u0161il\u00e1k","year":"2020","unstructured":"Vor\u0161il\u00e1k M, Kol\u00e1\u0159 M, \u010cmelo I, Svozil D (2020) SYBA: Bayesian estimation of synthetic accessibility of organic compounds. J Cheminform 12:35. https:\/\/doi.org\/10.1186\/s13321-020-00439-2","journal-title":"J Cheminform"},{"key":"582_CR20","doi-asserted-by":"publisher","first-page":"604","DOI":"10.1038\/nature25978","volume":"555","author":"MHS Segler","year":"2018","unstructured":"Segler MHS, Preuss M, Waller MP (2018) Planning chemical syntheses with deep neural networks and symbolic AI. Nature 555:604\u2013610. https:\/\/doi.org\/10.1038\/nature25978","journal-title":"Nature"},{"key":"582_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s13321-020-00472-1","volume":"12","author":"S Genheden","year":"2020","unstructured":"Genheden S, Thakkar A, Chadimov\u00e1 V et al (2020) AiZynthFinder: a fast, robust and flexible open-source software for retrosynthetic planning. J Cheminform 12:1\u20139. https:\/\/doi.org\/10.1186\/s13321-020-00472-1","journal-title":"J Cheminform"},{"key":"582_CR22","doi-asserted-by":"publisher","first-page":"1083","DOI":"10.1021\/ci100350u","volume":"51","author":"Y Yuan","year":"2011","unstructured":"Yuan Y, Pei J, Lai L (2011) LigBuilder 2: a practical de novo drug design approach. J Chem Inf Model. 51:1083\u20131091. https:\/\/doi.org\/10.1021\/ci100350u","journal-title":"J Chem Inf Model."},{"key":"582_CR23","doi-asserted-by":"publisher","DOI":"10.7717\/peerj-pchem.18","volume":"3","author":"C Steinmann","year":"2021","unstructured":"Steinmann C, Jensen JH (2021) Using a genetic algorithm to find molecules with good docking scores. PeerJ Phys Chem 3:e18. https:\/\/doi.org\/10.7717\/peerj-pchem.18","journal-title":"PeerJ Phys Chem"},{"key":"582_CR24","doi-asserted-by":"publisher","first-page":"679","DOI":"10.1021\/ci700424b","volume":"48","author":"F Dey","year":"2008","unstructured":"Dey F, Caflisch A (2008) Fragment-based de novo ligand design by multi-objective evolutionary optimization. Supporting Information J Chem Inf Model 48:679\u2013690. https:\/\/doi.org\/10.1021\/ci700424b","journal-title":"Supporting Information J Chem Inf Model"},{"key":"582_CR25","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1021\/ci800308h","volume":"49","author":"CA Nicolaou","year":"2009","unstructured":"Nicolaou CA, Apostolakis J, Pattichis CS (2009) De novo drug design using multiobjective evolutionary graphs. J Chem Inf Model 49:295\u2013307. https:\/\/doi.org\/10.1021\/ci800308h","journal-title":"J Chem Inf Model"},{"key":"582_CR26","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1023\/A:1008184403558","volume":"14","author":"G Schneider","year":"2000","unstructured":"Schneider G, Lee ML, Stahl M, Schneider P (2000) De novo design of molecular architectures by evolutionary assembly of drug-derived building blocks. J Comput Aided Mol Des 14:487\u2013494. https:\/\/doi.org\/10.1023\/A:1008184403558","journal-title":"J Comput Aided Mol Des"},{"key":"582_CR27","doi-asserted-by":"publisher","first-page":"699","DOI":"10.1021\/ci0503560","volume":"46","author":"U Fechner","year":"2006","unstructured":"Fechner U, Schneider G (2006) Flux (1): A virtual synthesis scheme for fragment-based de novo design. J Chem Inf Model 46:699\u2013707. https:\/\/doi.org\/10.1021\/ci0503560","journal-title":"J Chem Inf Model"},{"key":"582_CR28","doi-asserted-by":"publisher","first-page":"2765","DOI":"10.1021\/jm030809x","volume":"46","author":"HM Vinkers","year":"2003","unstructured":"Vinkers HM, De Jonge MR, Daeyaert FFD et al (2003) SYNOPSIS: SYNthesize and OPtimize system in silico. J Med Chem 46:2765\u20132773. https:\/\/doi.org\/10.1021\/jm030809x","journal-title":"J Med Chem"},{"key":"582_CR29","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pcbi.1002380","volume":"8","author":"M Hartenfeller","year":"2012","unstructured":"Hartenfeller M, Zettl H, Walter M et al (2012) Dogs: reaction-driven de novo design of bioactive compounds. PLoS Comput Biol 8:e1002380. https:\/\/doi.org\/10.1371\/journal.pcbi.1002380","journal-title":"PLoS Comput Biol"},{"key":"582_CR30","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s13321-020-00429-4","volume":"12","author":"JO Spiegel","year":"2020","unstructured":"Spiegel JO, Durrant JD (2020) AutoGrow4: an open-source genetic algorithm for de novo drug design and lead optimization. J Cheminform 12:1\u201316. https:\/\/doi.org\/10.1186\/s13321-020-00429-4","journal-title":"J Cheminform"},{"key":"582_CR31","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1021\/acscentsci.7b00572","volume":"4","author":"R G\u00f3mez-Bombarelli","year":"2018","unstructured":"G\u00f3mez-Bombarelli R, Wei JN, Duvenaud D et al (2018) Automatic chemical design using a data-driven continuous representation of molecules. ACS Cent Sci 4:268\u2013276. https:\/\/doi.org\/10.1021\/acscentsci.7b00572","journal-title":"ACS Cent Sci"},{"key":"582_CR32","doi-asserted-by":"publisher","first-page":"1175","DOI":"10.1021\/acs.jcim.9b00943","volume":"60","author":"F Grisoni","year":"2020","unstructured":"Grisoni F, Moret M, Lingwood R, Schneider G (2020) Bidirectional molecule generation with recurrent neural networks. J Chem Inf Model 60:1175\u20131183. https:\/\/doi.org\/10.1021\/acs.jcim.9b00943","journal-title":"J Chem Inf Model"},{"key":"582_CR33","doi-asserted-by":"publisher","first-page":"1194","DOI":"10.1021\/acs.jcim.7b00690","volume":"58","author":"E Putin","year":"2018","unstructured":"Putin E, Asadulaev A, Ivanenkov Y et al (2018) Reinforced adversarial neural computer for de novo molecular design. J Chem Inf Model 58:1194\u20131204. https:\/\/doi.org\/10.1021\/acs.jcim.7b00690","journal-title":"J Chem Inf Model"},{"key":"582_CR34","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1021\/ci400418c","volume":"54","author":"K Kawai","year":"2014","unstructured":"Kawai K, Nagata N, Takahashi Y (2014) De novo design of drug-like molecules by a fragment-based molecular evolutionary approach. J Chem Inf Model 54:49\u201356. https:\/\/doi.org\/10.1021\/ci400418c","journal-title":"J Chem Inf Model"},{"key":"582_CR35","doi-asserted-by":"publisher","first-page":"3567","DOI":"10.1039\/c8sc05372c","volume":"10","author":"JH Jensen","year":"2019","unstructured":"Jensen JH (2019) A graph-based genetic algorithm and generative model\/Monte Carlo tree search for the exploration of chemical space. Chem Sci 10:3567\u20133572. https:\/\/doi.org\/10.1039\/c8sc05372c","journal-title":"Chem Sci"},{"key":"582_CR36","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1023\/a:1008108423895","volume":"14","author":"D Douguet","year":"2000","unstructured":"Douguet D, Thoreau E, Grassy G (2000) A genetic algorithm for the automated generation of small organic molecules: drug design using an evolutionary algorithm. J Comput Aided Mol Des 14:449\u2013466. https:\/\/doi.org\/10.1023\/a:1008108423895","journal-title":"J Comput Aided Mol Des"},{"key":"582_CR37","doi-asserted-by":"publisher","first-page":"911","DOI":"10.1023\/a:1014389729000","volume":"15","author":"SC Pegg","year":"2001","unstructured":"Pegg SC, Haresco JJ, Kuntz ID (2001) A genetic algorithm for structure-based de novo design. J Comput Aided Mol Des 15:911\u2013933. https:\/\/doi.org\/10.1023\/a:1014389729000","journal-title":"J Comput Aided Mol Des"},{"key":"582_CR38","doi-asserted-by":"publisher","first-page":"1079","DOI":"10.1002\/chin.200431198","volume":"35","author":"N Brown","year":"2004","unstructured":"Brown N, McKay B, Gilardoni F, Gasteiger J (2004) A graph-based genetic algorithm and its application to the multiobjective evolution of median molecules. ChemInform 35:1079\u20131087. https:\/\/doi.org\/10.1002\/chin.200431198","journal-title":"ChemInform"},{"key":"582_CR39","doi-asserted-by":"publisher","first-page":"2457","DOI":"10.1021\/jm0492296","volume":"48","author":"D Douguet","year":"2005","unstructured":"Douguet D, Munier-Lehmann H, Labesse G, Pochet S (2005) LEA3D: a computer-aided ligand design for structure-based drug design. J Med Chem 48:2457\u20132468. https:\/\/doi.org\/10.1021\/jm0492296","journal-title":"J Med Chem"},{"key":"582_CR40","doi-asserted-by":"publisher","first-page":"490","DOI":"10.1002\/(SICI)1096-987X(199604)17:5\/6<520::AID-JCC2>3.0.CO;2-W","volume":"17","author":"TA Halgren","year":"1996","unstructured":"Halgren TA (1996) Merck molecular force field. J Comput Chem 17:490\u2013519. https:\/\/doi.org\/10.1002\/(SICI)1096-987X(199604)17:5\/6%3c520::AID-JCC2%3e3.0.CO;2-W","journal-title":"J Comput Chem"},{"key":"582_CR41","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1021\/c160017a018","volume":"5","author":"HL Morgan","year":"1965","unstructured":"Morgan HL (1965) The generation of a unique machine description for chemical structures\u2014a technique developed at chemical abstracts service. J Chem Doc 5:107\u2013113. https:\/\/doi.org\/10.1021\/c160017a018","journal-title":"J Chem Doc"},{"key":"582_CR42","doi-asserted-by":"publisher","first-page":"742","DOI":"10.1021\/ci100050t","volume":"50","author":"D Rogers","year":"2010","unstructured":"Rogers D, Hahn M (2010) Extended-connectivity fingerprints. J Chem Inf Model 50:742\u2013754. https:\/\/doi.org\/10.1021\/ci100050t","journal-title":"J Chem Inf Model"},{"key":"582_CR43","unstructured":"RDKit: Open-source cheminformatics. http:\/\/www.rdkit.org\/"},{"key":"582_CR44","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1021\/ci030405d","volume":"44","author":"F Berger","year":"2004","unstructured":"Berger F, Flamm C, Gleiss PM et al (2004) Counterexamples in chemical ring perception. J Chem Inf Comput Sci 44:323\u2013331. https:\/\/doi.org\/10.1021\/ci030405d","journal-title":"J Chem Inf Comput Sci"},{"key":"582_CR45","unstructured":"ChemAxon ChemAxon Extended SMILES and SMARTS - CXSMILES and CXSMARTS. https:\/\/docs.chemaxon.com\/display\/docs\/chemaxon-extended-smiles-and-smarts-cxsmiles-and-cxsmarts.md. Accessed 10 Sep 2021"},{"key":"582_CR46","unstructured":"Hipp DR SQLite. https:\/\/www.sqlite.org"},{"key":"582_CR47","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1111\/j.1747-0285.2012.01414.x","volume":"80","author":"S Lindert","year":"2012","unstructured":"Lindert S, Durrant JD, Mccammon JA (2012) LigMerge: a fast algorithm to generate models of novel potential ligands from sets of known binders. Chem Biol Drug Des 80:358\u2013365. https:\/\/doi.org\/10.1111\/j.1747-0285.2012.01414.x","journal-title":"Chem Biol Drug Des"},{"key":"582_CR48","doi-asserted-by":"crossref","unstructured":"Hopcroft JE, Karp RM (1971) N5\/2 Algorithm for Maximum Matchings in Bipartite Graphs. pp 122\u2013125","DOI":"10.1109\/SWAT.1971.1"},{"key":"582_CR49","unstructured":"The HDF Group HDF5. https:\/\/www.hdfgroup.org\/solutions\/hdf5"},{"key":"582_CR50","doi-asserted-by":"publisher","first-page":"1100","DOI":"10.1093\/nar\/gkr777","volume":"40","author":"A Gaulton","year":"2012","unstructured":"Gaulton A, Bellis LJ, Bento AP et al (2012) ChEMBL: a large-scale bioactivity database for drug discovery. Nucleic Acids Res 40:1100\u20131107. https:\/\/doi.org\/10.1093\/nar\/gkr777","journal-title":"Nucleic Acids Res"},{"key":"582_CR51","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1214\/aoms\/1177730491","volume":"18","author":"HB Mann","year":"1947","unstructured":"Mann HB, Whitney DR (1947) On a test of whether one of two random variables is stochastically larger than the other. Ann Math Stat 18:50\u201360","journal-title":"Ann Math Stat"},{"key":"582_CR52","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1080\/01621459.1952.10483441","volume":"47","author":"WH Kruskal","year":"1952","unstructured":"Kruskal WH, Wallis WA (1952) Use of ranks in one-criterion variance analysis. J Am Stat Assoc 47:583\u2013621. https:\/\/doi.org\/10.1080\/01621459.1952.10483441","journal-title":"J Am Stat Assoc"},{"key":"582_CR53","doi-asserted-by":"publisher","first-page":"429","DOI":"10.2307\/2529511","volume":"32","author":"CJ Scheirer","year":"1976","unstructured":"Scheirer CJ, Ray WS, Hare N (1976) The analysis of ranked data derived from completely randomized factorial designs. Biometrics 32:429\u2013434","journal-title":"Biometrics"},{"key":"582_CR54","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1080\/00031305.1981.10479327","volume":"35","author":"WJ Conover","year":"1981","unstructured":"Conover WJ, Iman RL (1981) Rank transformations as a bridge between parametric and nonparametric statistics. Am Stat 35:124\u2013129","journal-title":"Am Stat"},{"key":"582_CR55","doi-asserted-by":"publisher","first-page":"626","DOI":"10.1080\/01621459.1967.10482935","volume":"62","author":"Z \u0160id\u00e1k","year":"1967","unstructured":"\u0160id\u00e1k Z (1967) Rectangular confidence regions for the means of multivariate normal distributions. J Am Stat Assoc 62:626\u2013633. https:\/\/doi.org\/10.1080\/01621459.1967.10482935","journal-title":"J Am Stat Assoc"},{"key":"582_CR56","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1111\/j.1747-0285.2008.00672.x","volume":"72","author":"M Hartenfeller","year":"2008","unstructured":"Hartenfeller M, Proschak E, Sch\u00fcller A, Schneider G (2008) Concept of combinatorial de novo design of drug-like molecules by particle swarm optimization. Chem Biol Drug Des 72:16\u201326. https:\/\/doi.org\/10.1111\/j.1747-0285.2008.00672.x","journal-title":"Chem Biol Drug Des"},{"key":"582_CR57","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1021\/jm0603365","volume":"50","author":"PCD Hawkins","year":"2007","unstructured":"Hawkins PCD, Skillman AG, Nicholls A (2007) Comparison of shape-matching and docking as virtual screening tools. J Med Chem 50:74\u201382","journal-title":"J Med Chem"},{"key":"582_CR58","unstructured":"OpenEye Scientific Software ROCS. https:\/\/www.eyesopen.com"}],"container-title":["Journal of Cheminformatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s13321-022-00582-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1186\/s13321-022-00582-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s13321-022-00582-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,16]],"date-time":"2024-09-16T10:57:52Z","timestamp":1726484272000},"score":1,"resource":{"primary":{"URL":"https:\/\/jcheminf.biomedcentral.com\/articles\/10.1186\/s13321-022-00582-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,1,15]]},"references-count":58,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,12]]}},"alternative-id":["582"],"URL":"https:\/\/doi.org\/10.1186\/s13321-022-00582-y","relation":{},"ISSN":["1758-2946"],"issn-type":[{"value":"1758-2946","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,1,15]]},"assertion":[{"value":"11 November 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 December 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 January 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Not applicable.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"3"}}