{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,25]],"date-time":"2026-08-25T17:56:06Z","timestamp":1787680566410,"version":"build-2784847793"},"reference-count":74,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2020,5,20]],"date-time":"2020-05-20T00:00:00Z","timestamp":1589932800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2020,5,20]],"date-time":"2020-05-20T00:00:00Z","timestamp":1589932800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001823","name":"Ministerstvo \u0160kolstv\u00ed, Ml\u00e1de\u017ee a T\u011blov\u00fdchovy","doi-asserted-by":"publisher","award":["RVO 68378050-KAV-NPUI"],"award-info":[{"award-number":["RVO 68378050-KAV-NPUI"]}],"id":[{"id":"10.13039\/501100001823","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001823","name":"Ministerstvo \u0160kolstv\u00ed, Ml\u00e1de\u017ee a T\u011blov\u00fdchovy","doi-asserted-by":"publisher","award":["RVO 68378050-KAV-NPUI"],"award-info":[{"award-number":["RVO 68378050-KAV-NPUI"]}],"id":[{"id":"10.13039\/501100001823","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001823","name":"Ministerstvo \u0160kolstv\u00ed, Ml\u00e1de\u017ee a T\u011blov\u00fdchovy","doi-asserted-by":"publisher","award":["RVO 68378050-KAV-NPUI"],"award-info":[{"award-number":["RVO 68378050-KAV-NPUI"]}],"id":[{"id":"10.13039\/501100001823","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001823","name":"Ministerstvo \u0160kolstv\u00ed, Ml\u00e1de\u017ee a T\u011blov\u00fdchovy","doi-asserted-by":"publisher","award":["LM2018130"],"award-info":[{"award-number":["LM2018130"]}],"id":[{"id":"10.13039\/501100001823","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001823","name":"Ministerstvo \u0160kolstv\u00ed, Ml\u00e1de\u017ee a T\u011blov\u00fdchovy","doi-asserted-by":"publisher","award":["LM2018130"],"award-info":[{"award-number":["LM2018130"]}],"id":[{"id":"10.13039\/501100001823","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001823","name":"Ministerstvo \u0160kolstv\u00ed, Ml\u00e1de\u017ee a T\u011blov\u00fdchovy","doi-asserted-by":"publisher","award":["LM2018130"],"award-info":[{"award-number":["LM2018130"]}],"id":[{"id":"10.13039\/501100001823","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001823","name":"Ministerstvo \u0160kolstv\u00ed, Ml\u00e1de\u017ee a T\u011blov\u00fdchovy","doi-asserted-by":"publisher","award":["20\/2015"],"award-info":[{"award-number":["20\/2015"]}],"id":[{"id":"10.13039\/501100001823","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Operational Programme Research, Development and Education","award":["CZ.02.1.01\/0.0\/0.0\/16_019\/0000785"],"award-info":[{"award-number":["CZ.02.1.01\/0.0\/0.0\/16_019\/0000785"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Cheminform"],"published-print":{"date-parts":[[2020,12]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>\n                    SYBA (SYnthetic Bayesian Accessibility) is a fragment-based method for the rapid classification of organic compounds as easy- (ES) or hard-to-synthesize (HS). It is based on a Bernoulli na\u00efve Bayes classifier that is used to assign SYBA score contributions to individual fragments based on their frequencies in the database of ES and HS molecules. SYBA was trained on ES molecules available in the ZINC15 database and on HS molecules generated by the Nonpher methodology. SYBA was compared with a random forest, that was utilized as a baseline method, as well as with other two methods for synthetic accessibility assessment: SAScore and SCScore. When used with their suggested thresholds, SYBA improves over random forest classification, albeit marginally, and outperforms SAScore and SCScore. However, upon the optimization of SAScore threshold (that changes from 6.0 to \u2013\u20094.5), SAScore yields similar results as SYBA. Because SYBA is based merely on fragment contributions, it can be used for the analysis of the contribution of individual molecular parts to compound synthetic accessibility. SYBA is publicly available at\n                    <jats:ext-link xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" ext-link-type=\"uri\" xlink:href=\"https:\/\/github.com\/lich-uct\/syba\">https:\/\/github.com\/lich-uct\/syba<\/jats:ext-link>\n                    under the GNU General Public License.\n                  <\/jats:p>","DOI":"10.1186\/s13321-020-00439-2","type":"journal-article","created":{"date-parts":[[2020,5,20]],"date-time":"2020-05-20T02:02:57Z","timestamp":1589940177000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":122,"title":["SYBA: Bayesian estimation of synthetic accessibility of organic compounds"],"prefix":"10.1186","volume":"12","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8923-1627","authenticated-orcid":false,"given":"Milan","family":"Vor\u0161il\u00e1k","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4593-1525","authenticated-orcid":false,"given":"Michal","family":"Kol\u00e1\u0159","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7787-8653","authenticated-orcid":false,"given":"Ivan","family":"\u010cmelo","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2577-5163","authenticated-orcid":false,"given":"Daniel","family":"Svozil","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2020,5,20]]},"reference":[{"issue":"1","key":"439_CR1","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(1):3\u201350","journal-title":"Med Res Rev"},{"issue":"8","key":"439_CR2","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(8):675\u2013679","journal-title":"J Comput Aided Mol Des"},{"issue":"2","key":"439_CR3","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1021\/ci0255782","volume":"43","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 43(2):374\u2013380","journal-title":"J Chem Inf Comput Sci"},{"issue":"1","key":"439_CR4","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1039\/c0md00020e","volume":"1","author":"JL Reymond","year":"2010","unstructured":"Reymond JL, van Deursen R, Blum LC, Ruddigkeit L (2010) Chemical space as a source for new drugs. Medchemcomm 1(1):30\u201338","journal-title":"Medchemcomm"},{"issue":"26","key":"439_CR5","doi-asserted-by":"publisher","first-page":"12660","DOI":"10.1073\/pnas.1816039116","volume":"116","author":"EJ Llanos","year":"2019","unstructured":"Llanos EJ, Leal W, Luu DH, Jost J, Stadler PF, Restrepo G (2019) Exploration of the chemical space and its three historical regimes. Proc Natl Acad Sci U S A 116(26):12660\u201312665","journal-title":"Proc Natl Acad Sci U S A"},{"issue":"9","key":"439_CR6","doi-asserted-by":"publisher","first-page":"5151","DOI":"10.1039\/C8RA10182E","volume":"9","author":"DS Karlov","year":"2019","unstructured":"Karlov DS, Sosnin S, Tetko IV, Fedorov MV (2019) Chemical space exploration guided by deep neural networks. Rsc Advances 9(9):5151\u20135157","journal-title":"Rsc Advances"},{"issue":"2","key":"439_CR7","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1038\/s41570-018-0066-y","volume":"3","author":"PS Gromski","year":"2019","unstructured":"Gromski PS, Henson AB, Granda JM, Cronin L (2019) How to explore chemical space using algorithms and automation. Nat Rev Chem 3(2):119\u2013128","journal-title":"Nat Rev Chem"},{"issue":"3","key":"439_CR8","doi-asserted-by":"publisher","first-page":"1116","DOI":"10.1021\/acs.jmedchem.8b01048","volume":"62","author":"WP Walters","year":"2019","unstructured":"Walters WP (2019) Virtual chemical libraries. J Med Chem 62(3):1116\u20131124","journal-title":"J Med Chem"},{"issue":"4","key":"439_CR9","doi-asserted-by":"publisher","first-page":"1247","DOI":"10.1021\/ar400284t","volume":"47","author":"RM Franzini","year":"2014","unstructured":"Franzini RM, Neri D, Scheuermann J (2014) DNA-encoded chemical libraries: advancing beyond conventional small-molecule libraries. Acc Chem Res 47(4):1247\u20131255","journal-title":"Acc Chem Res"},{"issue":"6","key":"439_CR10","doi-asserted-by":"publisher","first-page":"475","DOI":"10.2174\/138620711795767866","volume":"14","author":"F Lopez-Vallejo","year":"2011","unstructured":"Lopez-Vallejo F, Caulfield T, Martinez-Mayorga K, Giulianotti MA, Nefzi A, Houghten RA, Medina-Franco JL (2011) Integrating virtual screening and combinatorial chemistry for accelerated drug discovery. Comb Chem High Throughput Screen 14(6):475\u2013487","journal-title":"Comb Chem High Throughput Screen"},{"issue":"5","key":"439_CR11","doi-asserted-by":"publisher","first-page":"1148","DOI":"10.1016\/j.drudis.2019.02.013","volume":"24","author":"T Hoffmann","year":"2019","unstructured":"Hoffmann T, Gastreich M (2019) The next level in chemical space navigation: going far beyond enumerable compound libraries. Drug Discov Today 24(5):1148\u20131156","journal-title":"Drug Discov Today"},{"issue":"2","key":"439_CR12","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1021\/acs.jcim.8b00737","volume":"59","author":"N van Hilten","year":"2019","unstructured":"van Hilten N, Chevillard F, Kolb P (2019) Virtual compound libraries in computer-assisted drug discovery. J Chem Inf Model 59(2):644\u2013651","journal-title":"J Chem Inf Model"},{"issue":"8","key":"439_CR13","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(8):649\u2013663","journal-title":"Nat Rev Drug Discov"},{"issue":"1","key":"439_CR14","doi-asserted-by":"publisher","first-page":"14","DOI":"10.2174\/156802610790232305","volume":"10","author":"K Loving","year":"2010","unstructured":"Loving K, Alberts I, Sherman W (2010) Computational approaches for fragment-based and de novo design. Curr Top Med Chem 10(1):14\u201332","journal-title":"Curr Top Med Chem"},{"issue":"2","key":"439_CR15","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1517\/17460441.2014.872624","volume":"9","author":"JL Medina-Franco","year":"2014","unstructured":"Medina-Franco JL, Martinez-Mayorga K, Meurice N (2014) Balancing novelty with confined chemical space in modern drug discovery. Expert Opin Drug Discov 9(2):151\u2013165","journal-title":"Expert Opin Drug Discov"},{"issue":"9","key":"439_CR16","doi-asserted-by":"publisher","first-page":"4077","DOI":"10.1021\/acs.jmedchem.5b01849","volume":"59","author":"P Schneider","year":"2016","unstructured":"Schneider P, Schneider G (2016) De Novo design at the edge of Chaos. J Med Chem 59(9):4077\u20134086","journal-title":"J Med Chem"},{"issue":"8","key":"439_CR17","doi-asserted-by":"publisher","first-page":"789","DOI":"10.1517\/17460441.2010.497534","volume":"5","author":"PS Kutchukian","year":"2010","unstructured":"Kutchukian PS, Shakhnovich EI (2010) De novo design: balancing novelty and confined chemical space. Expert Opin Drug Discov 5(8):789\u2013812","journal-title":"Expert Opin Drug Discov"},{"key":"439_CR18","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/978-1-60761-839-3_12","volume":"672","author":"M Hartenfeller","year":"2011","unstructured":"Hartenfeller M, Schneider G (2011) De novo drug design. Methods Mol Biol 672:299\u2013323","journal-title":"Methods Mol Biol"},{"issue":"1","key":"439_CR19","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, Schuller A, Schneider G (2008) Concept of combinatorial de novo design of drug-like molecules by particle swarm optimization. Chem Biol Drug Des 72(1):16\u201326","journal-title":"Chem Biol Drug Des"},{"issue":"13","key":"439_CR20","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 FF, Heeres J, Koymans LM, van Lenthe JH, Lewi PJ, Timmerman H, Van Aken K, Janssen PA (2003) SYNOPSIS: SYNthesize and OPtimize System in Silico. J Med Chem 46(13):2765\u20132773","journal-title":"J Med Chem"},{"issue":"2","key":"439_CR21","doi-asserted-by":"publisher","first-page":"e1002380","DOI":"10.1371\/journal.pcbi.1002380","volume":"8","author":"M Hartenfeller","year":"2012","unstructured":"Hartenfeller M, Zettl H, Walter M, Rupp M, Reisen F, Proschak E, Weggen S, Stark H, Schneider G (2012) DOGS: reaction-driven de novo design of bioactive compounds. PLoS Comput Biol 8(2):e1002380","journal-title":"PLoS Comput Biol"},{"issue":"5","key":"439_CR22","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(5):487\u2013494","journal-title":"J Comput Aided Mol Des"},{"issue":"2","key":"439_CR23","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(2):699\u2013707","journal-title":"J Chem Inf Model"},{"issue":"6","key":"439_CR24","doi-asserted-by":"publisher","first-page":"1241","DOI":"10.1016\/j.drudis.2018.01.039","volume":"23","author":"H Chen","year":"2018","unstructured":"Chen H, Engkvist O, Wang Y, Olivecrona M, Blaschke T (2018) The rise of deep learning in drug discovery. Drug Discov Today 23(6):1241\u20131250","journal-title":"Drug Discov Today"},{"issue":"10","key":"439_CR25","doi-asserted-by":"publisher","DOI":"10.3390\/molecules23102520","volume":"23","author":"G Hessler","year":"2018","unstructured":"Hessler G, Baringhaus KH (2018) Artificial intelligence in drug design. Molecules. 23(10):2520. https:\/\/doi.org\/10.3390\/molecules23102520","journal-title":"Molecules."},{"issue":"6","key":"439_CR26","doi-asserted-by":"publisher","first-page":"567","DOI":"10.4155\/fmc-2018-0358","volume":"11","author":"Y Xu","year":"2019","unstructured":"Xu Y, Lin K, Wang S, Wang L, Cai C, Song C, Lai L, Pei J (2019) Deep learning for molecular generation. Future Med Chem 11(6):567\u2013597","journal-title":"Future Med Chem"},{"issue":"7","key":"439_CR27","doi-asserted-by":"publisher","first-page":"7885","DOI":"10.1126\/sciadv.aap7885","volume":"4","author":"M Popova","year":"2018","unstructured":"Popova M, Isayev O, Tropsha A (2018) Deep reinforcement learning for de novo drug design. Sci Adv 4(7):7885","journal-title":"Sci Adv"},{"issue":"1","key":"439_CR28","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1186\/s13321-017-0235-x","volume":"9","author":"M Olivecrona","year":"2017","unstructured":"Olivecrona M, Blaschke T, Engkvist O, Chen H (2017) Molecular de-novo design through deep reinforcement learning. J Cheminform 9(1):48","journal-title":"J Cheminform"},{"issue":"1\u20132","key":"439_CR29","doi-asserted-by":"publisher","first-page":"1700123","DOI":"10.1002\/minf.201700123","volume":"37","author":"T Blaschke","year":"2018","unstructured":"Blaschke T, Olivecrona M, Engkvist O, Bajorath J, Chen H (2018) Application of generative autoencoder in de novo molecular design. Mol Inform. 37(1\u20132):1700123","journal-title":"Mol Inform."},{"issue":"1","key":"439_CR30","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1021\/acscentsci.7b00512","volume":"4","author":"MHS Segler","year":"2018","unstructured":"Segler MHS, Kogej T, Tyrchan C, Waller MP (2018) Generating focused molecule libraries for drug discovery with recurrent neural networks. ACS Cent Sci 4(1):120\u2013131","journal-title":"ACS Cent Sci"},{"issue":"1\u20132","key":"439_CR31","doi-asserted-by":"publisher","first-page":"1700111","DOI":"10.1002\/minf.201700111","volume":"37","author":"A Gupta","year":"2018","unstructured":"Gupta A, M\u00fcller AT, Huisman BJ, Fuchs JA, Schneider P, Schneider G (2018) Generative recurrent networks for de novo drug design. Mol Inform. 37(1\u20132):1700111","journal-title":"Mol Inform."},{"issue":"1\u20132","key":"439_CR32","doi-asserted-by":"publisher","first-page":"1700153","DOI":"10.1002\/minf.201700153","volume":"37","author":"D Merk","year":"2018","unstructured":"Merk D, Friedrich L, Grisoni F, Schneider G (2018) De novo design of bioactive small molecules by artificial intelligence. Mol Inform. 37(1\u20132):1700153","journal-title":"Mol Inform."},{"issue":"1","key":"439_CR33","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1016\/j.drudis.2016.08.009","volume":"22","author":"O Mendez-Lucio","year":"2017","unstructured":"Mendez-Lucio O, Medina-Franco JL (2017) The many roles of molecular complexity in drug discovery. Drug Discov Today 22(1):120\u2013126","journal-title":"Drug Discov Today"},{"issue":"12","key":"439_CR34","doi-asserted-by":"publisher","first-page":"3599","DOI":"10.1021\/ja00402a071","volume":"103","author":"SH Bertz","year":"1981","unstructured":"Bertz SH (1981) The first general index of molecular complexity. J Am Chem Soc 103(12):3599\u20133601","journal-title":"J Am Chem Soc"},{"issue":"22","key":"439_CR35","doi-asserted-by":"publisher","first-page":"7982","DOI":"10.1021\/jo9814546","volume":"63","author":"HW Whitlock","year":"1998","unstructured":"Whitlock HW (1998) On the structure of total synthesis of complex natural products. J Organic Chem 63(22):7982\u20137989","journal-title":"J Organic Chem"},{"issue":"2","key":"439_CR36","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1021\/ci000145p","volume":"41","author":"R Barone","year":"2001","unstructured":"Barone R, Chanon M (2001) A new and simple approach to chemical complexity application to the synthesis of natural products. J Chem Inf Comp Sci 41(2):269\u2013272","journal-title":"J Chem Inf Comp Sci"},{"issue":"5","key":"439_CR37","doi-asserted-by":"publisher","first-page":"1237","DOI":"10.1021\/ci0501387","volume":"45","author":"TK Allu","year":"2005","unstructured":"Allu TK, Oprea TI (2005) Rapid evaluation of synthetic and molecular complexity for in silico chemistry. J Chem Inf Model 45(5):1237\u20131243","journal-title":"J Chem Inf Model"},{"issue":"3","key":"439_CR38","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1016\/j.cbpa.2005.04.001","volume":"9","author":"P Selzer","year":"2005","unstructured":"Selzer P, Roth HJ, Ertl P, Schuffenhauer A (2005) Complex molecules: do they add value? Curr Opin Chem Biol 9(3):310\u2013316","journal-title":"Curr Opin Chem Biol"},{"issue":"6","key":"439_CR39","doi-asserted-by":"publisher","first-page":"1604","DOI":"10.1021\/ci5001778","volume":"54","author":"RP Sheridan","year":"2014","unstructured":"Sheridan RP, Zorn N, Sherer EC, Campeau LC, Chang CZ, Cumming J, Maddess ML, Nantermet PG, Sinz CJ, O\u2019Shea PD (2014) Modeling a crowdsourced definition of molecular complexity. J Chem Inf Model 54(6):1604\u20131616","journal-title":"J Chem Inf Model"},{"key":"439_CR40","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","journal-title":"Perspect Drug Discov Des"},{"issue":"10","key":"439_CR41","doi-asserted-by":"publisher","first-page":"2768","DOI":"10.1021\/ci100216g","volume":"51","author":"Q Huang","year":"2011","unstructured":"Huang Q, Li L-L, Yang S-Y (2011) RASA: a rapid retrosynthesis-based scoring method for the assessment of synthetic accessibility of drug-like molecules. J Chem Inf Model 51(10):2768\u20132777","journal-title":"J Chem Inf Model"},{"issue":"26","key":"439_CR42","doi-asserted-by":"publisher","first-page":"7164","DOI":"10.1039\/C5OB00709G","volume":"13","author":"J Li","year":"2015","unstructured":"Li J, Eastgate MD (2015) Current complexity: a tool for assessing the complexity of organic molecules. Org Biomol Chem 13(26):7164\u20137176","journal-title":"Org Biomol Chem"},{"issue":"2","key":"439_CR43","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1021\/acs.jcim.7b00622","volume":"58","author":"CW Coley","year":"2018","unstructured":"Coley CW, Rogers L, Green WH, Jensen KF (2018) SCScore: synthetic complexity learned from a reaction corpus. J Chem Inf Model 58(2):252\u2013261","journal-title":"J Chem Inf Model"},{"key":"439_CR44","unstructured":"Reaxys. https:\/\/www.reaxys.com. Accessed 24 January 2020"},{"key":"439_CR45","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 Cheminf 1:1\u201311","journal-title":"J Cheminf"},{"issue":"5","key":"439_CR46","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(5):742\u2013754","journal-title":"J Chem Inf Model"},{"issue":"D1","key":"439_CR47","doi-asserted-by":"publisher","first-page":"D1102","DOI":"10.1093\/nar\/gky1033","volume":"47","author":"S Kim","year":"2019","unstructured":"Kim S, Chen J, Cheng T, Gindulyte A, He J, He S, Li Q, Shoemaker BA, Thiessen PA, Yu B et al (2019) PubChem 2019 update: improved access to chemical data. Nucleic Acids Res 47(D1):D1102\u2013D1109","journal-title":"Nucleic Acids Res"},{"issue":"7428","key":"439_CR48","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1038\/nature11691","volume":"492","author":"J Besnard","year":"2012","unstructured":"Besnard J, Ruda GF, Setola V, Abecassis K, Rodriguiz RM, Huang XP, Norval S, Sassano MF, Shin AI, Webster LA et al (2012) Automated design of ligands to polypharmacological profiles. Nature 492(7428):215\u2013220","journal-title":"Nature"},{"issue":"1","key":"439_CR49","doi-asserted-by":"publisher","first-page":"972","DOI":"10.1080\/14686996.2017.1401424","volume":"18","author":"X Yang","year":"2017","unstructured":"Yang X, Zhang J, Yoshizoe K, Terayama K, Tsuda K (2017) ChemTS: an efficient python library for de novo molecular generation. Sci Technol Adv Mater 18(1):972\u2013976","journal-title":"Sci Technol Adv Mater"},{"issue":"9","key":"439_CR50","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(9):1824\u20131835","journal-title":"J Chem Inf Model"},{"issue":"6","key":"439_CR51","doi-asserted-by":"publisher","first-page":"1231","DOI":"10.1021\/acs.jcim.5b00143","volume":"55","author":"AM Clark","year":"2015","unstructured":"Clark AM, Dole K, Coulon-Spektor A, McNutt A, Grass G, Freundlich JS, Reynolds RC, Ekins S (2015) Open source Bayesian Models. 1. Application to ADME\/Tox and drug discovery datasets. J Chem Inf Model 55(6):1231\u20131245","journal-title":"J Chem Inf Model"},{"issue":"18","key":"439_CR52","doi-asserted-by":"publisher","first-page":"4463","DOI":"10.1021\/jm0303195","volume":"47","author":"X Xia","year":"2004","unstructured":"Xia X, Maliski EG, Gallant P, Rogers D (2004) Classification of kinase inhibitors using a Bayesian model. J Med Chem 47(18):4463\u20134470","journal-title":"J Med Chem"},{"key":"439_CR53","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/978-1-60761-839-3_7","volume":"672","author":"A Bender","year":"2011","unstructured":"Bender A (2011) Bayesian methods in virtual screening and chemical biology. Methods Mol Biol 672:175\u2013196","journal-title":"Methods Mol Biol"},{"issue":"2","key":"439_CR54","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1021\/ci600418u","volume":"47","author":"M Vogt","year":"2007","unstructured":"Vogt M, Bajorath J (2007) Introduction of an information-theoretic method to predict recovery rates of active compounds for Bayesian in silico screening: theory and screening trials. J Chem Inf Model 47(2):337\u2013341","journal-title":"J Chem Inf Model"},{"issue":"8","key":"439_CR55","doi-asserted-by":"publisher","first-page":"1957","DOI":"10.1021\/ci300435j","volume":"53","author":"A Koutsoukas","year":"2013","unstructured":"Koutsoukas A, Lowe R, Kalantarmotamedi Y, Mussa HY, Klaffke W, Mitchell JB, Glen RC, Bender A (2013) In silico target predictions: defining a benchmarking data set and comparison of performance of the multiclass Naive Bayes and Parzen-Rosenblatt window. J Chem Inf Model 53(8):1957\u20131966","journal-title":"J Chem Inf Model"},{"issue":"7","key":"439_CR56","doi-asserted-by":"publisher","first-page":"1757","DOI":"10.1021\/ci3001277","volume":"52","author":"JJ Irwin","year":"2012","unstructured":"Irwin JJ, Sterling T, Mysinger MM, Bolstad ES, Coleman RG (2012) ZINC: a free tool to discover chemistry for biology. J Chem Inf Model 52(7):1757\u20131768","journal-title":"J Chem Inf Model"},{"issue":"11","key":"439_CR57","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(11):2324\u20132337","journal-title":"J Chem Inf Model"},{"issue":"1","key":"439_CR58","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s13321-017-0206-2","volume":"9","author":"M Vor\u0161il\u00e1k","year":"2017","unstructured":"Vor\u0161il\u00e1k M, Svozil D (2017) Nonpher: computational method for design of hard-to-synthesize structures. J Cheminf 9(1):1\u201320","journal-title":"J Cheminf"},{"key":"439_CR59","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/1758-2946-6-7","volume":"6","author":"D Hoksza","year":"2014","unstructured":"Hoksza D, Skoda P, Vorsilak M, Svozil D (2014) Molpher: a software framework for systematic chemical space exploration. J Cheminf 6:1\u201313","journal-title":"J Cheminf"},{"key":"439_CR60","unstructured":"RDKit: open-source cheminformatics. http:\/\/www.rdkit.org. Accessed 24 January 2020"},{"issue":"11","key":"439_CR61","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 J-L (2012) Enumeration of 166 billion organic small molecules in the chemical universe database GDB-17. J Chem Inf Model 52(11):2864\u20132875","journal-title":"J Chem Inf Model"},{"issue":"6","key":"439_CR62","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/s10822-006-9099-2","volume":"21","author":"K Boda","year":"2007","unstructured":"Boda K, Seidel T, Gasteiger J (2007) Structure and reaction based evaluation of synthetic accessibility. J Comput-Aided Mol Des 21(6):311\u2013325","journal-title":"J Comput-Aided Mol Des"},{"issue":"12","key":"439_CR63","doi-asserted-by":"publisher","first-page":"3259","DOI":"10.1021\/ci500568d","volume":"54","author":"Y Fukunishi","year":"2014","unstructured":"Fukunishi Y, Kurosawa T, Mikami Y, Nakamura H (2014) Prediction of synthetic accessibility based on commercially available compound databases. J Chem Inf Model 54(12):3259\u20133267","journal-title":"J Chem Inf Model"},{"issue":"11","key":"439_CR64","doi-asserted-by":"publisher","first-page":"2837","DOI":"10.1021\/ci400482e","volume":"53","author":"RP Sheridan","year":"2013","unstructured":"Sheridan RP (2013) Using random forest to model the domain applicability of another random forest model. J Chem Inf Model 53(11):2837\u20132850","journal-title":"J Chem Inf Model"},{"issue":"1","key":"439_CR65","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1186\/s13321-018-0304-9","volume":"10","author":"A Kensert","year":"2018","unstructured":"Kensert A, Alvarsson J, Norinder U, Spjuth O (2018) Evaluating parameters for ligand-based modeling with random forest on sparse data sets. J Cheminform 10(1):49","journal-title":"J Cheminform"},{"issue":"6","key":"439_CR66","doi-asserted-by":"publisher","first-page":"1947","DOI":"10.1021\/ci034160g","volume":"43","author":"V Svetnik","year":"2003","unstructured":"Svetnik V, Liaw A, Tong C, Culberson JC, Sheridan RP, Feuston BP (2003) Random forest: a classification and regression tool for compound classification and QSAR modeling. J Chem Inf Comput Sci 43(6):1947\u20131958","journal-title":"J Chem Inf Comput Sci"},{"key":"439_CR67","first-page":"2825","volume":"12","author":"F Pedregosa","year":"2011","unstructured":"Pedregosa F, Varoquaux G, Gramfort A, Michel V, Thirion B, Grisel O, Blondel M, Prettenhofer P, Weiss R, Dubourg V et al (2011) Scikit-learn: machine Learning in Python. J Mach Learn Res 12:2825\u20132830","journal-title":"J Mach Learn Res"},{"key":"439_CR68","unstructured":"SCScore GitHub. https:\/\/github.com\/connorcoley\/scscore. Accessed 24 January 2020"},{"issue":"1","key":"439_CR69","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1002\/1097-0142(1950)3:1<32::AID-CNCR2820030106>3.0.CO;2-3","volume":"3","author":"WJ Youden","year":"1950","unstructured":"Youden WJ (1950) Index for rating diagnostic tests. Cancer 3(1):32\u201335","journal-title":"Cancer"},{"issue":"4","key":"439_CR70","doi-asserted-by":"publisher","first-page":"458","DOI":"10.1002\/bimj.200410135","volume":"47","author":"R Fluss","year":"2005","unstructured":"Fluss R, Faraggi D, Reiser B (2005) Estimation of the Youden Index and its associated cutoff point. Biom J 47(4):458\u2013472","journal-title":"Biom J"},{"issue":"1","key":"439_CR71","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1016\/0167-8655(88)90016-5","volume":"8","author":"SW Looney","year":"1988","unstructured":"Looney SW (1988) A statistical technique for comparing the accuracies of several classifiers. Pattern Recogn Lett 8(1):5\u20139","journal-title":"Pattern Recogn Lett"},{"issue":"4","key":"439_CR72","doi-asserted-by":"publisher","first-page":"1185","DOI":"10.1111\/j.1541-0420.2010.01408.x","volume":"66","author":"PH Westfall","year":"2010","unstructured":"Westfall PH, Troendle JF, Pennello G (2010) Multiple McNemar tests. Biometrics 66(4):1185\u20131191","journal-title":"Biometrics"},{"issue":"1","key":"439_CR73","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1111\/j.2517-6161.1995.tb02031.x","volume":"57","author":"Y Benjamini","year":"1995","unstructured":"Benjamini Y, Hochberg Y (1995) Controlling the false discovery rate\u2014a practical and powerful approach to multiple testing. J R Stat Soc Series B Stat Methodol 57(1):289\u2013300","journal-title":"J R Stat Soc Series B Stat Methodol"},{"issue":"1","key":"439_CR74","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1186\/1758-2946-5-43","volume":"5","author":"S Riniker","year":"2013","unstructured":"Riniker S, Landrum GA (2013) Similarity maps\u2014a visualization strategy for molecular fingerprints and machine-learning methods. J Cheminform 5(1):43","journal-title":"J Cheminform"}],"container-title":["Journal of Cheminformatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s13321-020-00439-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1186\/s13321-020-00439-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s13321-020-00439-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,5]],"date-time":"2024-08-05T21:39:08Z","timestamp":1722893948000},"score":1,"resource":{"primary":{"URL":"https:\/\/jcheminf.biomedcentral.com\/articles\/10.1186\/s13321-020-00439-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,5,20]]},"references-count":74,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2020,12]]}},"alternative-id":["439"],"URL":"https:\/\/doi.org\/10.1186\/s13321-020-00439-2","relation":{"has-preprint":[{"id-type":"doi","id":"10.21203\/rs.2.22597\/v3","asserted-by":"object"},{"id-type":"doi","id":"10.21203\/rs.2.22597\/v1","asserted-by":"object"},{"id-type":"doi","id":"10.21203\/rs.2.22597\/v2","asserted-by":"object"}]},"ISSN":["1758-2946"],"issn-type":[{"value":"1758-2946","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,5,20]]},"assertion":[{"value":"31 January 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 May 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 May 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The authors declare that they have no competing interests.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"35"}}