{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,27]],"date-time":"2026-05-27T21:11:04Z","timestamp":1779916264361,"version":"3.53.1"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2020,9,23]],"date-time":"2020-09-23T00:00:00Z","timestamp":1600819200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2020,9,23]],"date-time":"2020-09-23T00:00:00Z","timestamp":1600819200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/100014553","name":"Samsung Advanced Institute of Technology","doi-asserted-by":"crossref","id":[{"id":"10.13039\/100014553","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100003725","name":"National Research Foundation of Korea","doi-asserted-by":"crossref","award":["NRF-2019R1A4A1024732"],"award-info":[{"award-number":["NRF-2019R1A4A1024732"]}],"id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100003725","name":"National Research Foundation of Korea","doi-asserted-by":"crossref","award":["NRF-2020R1C1C1003232"],"award-info":[{"award-number":["NRF-2020R1C1C1003232"]}],"id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"crossref"}]}],"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><jats:p>Recently, deep learning has been successfully applied to molecular graph generation. Nevertheless, mitigating the computational complexity, which increases with the number of nodes in a graph, has been a major challenge. This has hindered the application of deep learning-based molecular graph generation to large molecules with many heavy atoms. In this study, we present a molecular graph compression method to alleviate the complexity while maintaining the capability of generating chemically valid and diverse molecular graphs. We designate six small substructural patterns that are prevalent between two atoms in real-world molecules. These relevant substructures in a molecular graph are then converted to edges by regarding them as additional edge features along with the bond types. This reduces the number of nodes significantly without any information loss. Consequently, a generative model can be constructed in a more efficient and scalable manner with large molecules on a compressed graph representation. We demonstrate the effectiveness of the proposed method for molecules with up to 88 heavy atoms using the GuacaMol benchmark.<\/jats:p>","DOI":"10.1186\/s13321-020-00463-2","type":"journal-article","created":{"date-parts":[[2020,9,23]],"date-time":"2020-09-23T12:03:02Z","timestamp":1600862582000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":20,"title":["Compressed graph representation for scalable molecular graph generation"],"prefix":"10.1186","volume":"12","author":[{"given":"Youngchun","family":"Kwon","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dongseon","family":"Lee","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Youn-Suk","family":"Choi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kyoham","family":"Shin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0960-0294","authenticated-orcid":false,"given":"Seokho","family":"Kang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2020,9,23]]},"reference":[{"key":"463_CR1","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1007\/978-3-030-40245-7_21","volume-title":"Machine learning meets quantum physics Lecture notes in physics","author":"D Schwalbe-Koda","year":"2020","unstructured":"Schwalbe-Koda D, G\u00f3mez-Bombarelli R (2020) Generative models for automatic chemical design. Machine learning meets quantum physics Lecture notes in physics. Springer, Berlin, pp 445\u2013467"},{"issue":"6400","key":"463_CR2","doi-asserted-by":"crossref","first-page":"360","DOI":"10.1126\/science.aat2663","volume":"361","author":"B Sanchez-Lengeling","year":"2018","unstructured":"Sanchez-Lengeling B, Aspuru-Guzik A (2018) Inverse Molecular Design Using Machine Learning: Generative Models for Matter Engineering. Scienc 361(6400):360\u2013365","journal-title":"Scienc"},{"issue":"4","key":"463_CR3","doi-asserted-by":"crossref","first-page":"828","DOI":"10.1039\/C9ME00039A","volume":"4","author":"DC Elton","year":"2019","unstructured":"Elton DC, Boukouvalas Z, Fuge MD, Chung PW (2019) Deep learning for molecular design\u2014a review of the State of the Art. Mol Syst Des Eng 4(4):828\u2013849","journal-title":"Mol Syst Des Eng"},{"key":"463_CR4","doi-asserted-by":"crossref","unstructured":"Goyal N, Jain HV, Ranu S (2020) GraphGen: a scalable approach to domain-agnostic labeled graph generation. In: Proceedings of the web conference; p. 1253\u20131263","DOI":"10.1145\/3366423.3380201"},{"issue":"D1","key":"463_CR5","doi-asserted-by":"crossref","first-page":"D1202","DOI":"10.1093\/nar\/gkv951","volume":"44","author":"S Kim","year":"2016","unstructured":"Kim S, Thiessen PA, Bolton EE, Chen J, Fu G, Gindulyte A et al (2016) PubChem substance and compound databases. Nucleic Acids Res 44(D1):D1202\u2013D1213","journal-title":"Nucleic Acids Res"},{"issue":"D1","key":"463_CR6","doi-asserted-by":"crossref","first-page":"D945","DOI":"10.1093\/nar\/gkw1074","volume":"45","author":"A Gaulton","year":"2016","unstructured":"Gaulton A, Hersey A, Nowotka M, Bento AP, Chambers J, Mendez D et al (2016) The ChEMBL database in 2017. Nucleic Acids Res 45(D1):D945\u2013D954","journal-title":"Nucleic Acids Res"},{"issue":"11","key":"463_CR7","doi-asserted-by":"crossref","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(11):2864\u20132875","journal-title":"J Chem Inf Model"},{"issue":"140022","key":"463_CR8","first-page":"1","volume":"1","author":"R Ramakrishnan","year":"2014","unstructured":"Ramakrishnan R, Dral PO, Rupp M, Von Lilienfeld OA (2014) Quantum chemistry structures and properties of 134 kilo molecules. Sci Data 1(140022):1\u20137","journal-title":"Sci Data"},{"issue":"11","key":"463_CR9","doi-asserted-by":"crossref","first-page":"2324","DOI":"10.1021\/acs.jcim.5b00559","volume":"55","author":"T Sterling","year":"2015","unstructured":"Sterling T, Irwin JJ (2015) ZINC 15-ligand discovery for everyone. J Chem Inf Model 55(11):2324\u20132337","journal-title":"J Chem Inf Model"},{"key":"463_CR10","unstructured":"You J, Ying R, Ren X, Hamilton W, Leskovec J (2018) GraphRNN: generating realistic graphs with deep auto-regressive models. In: Proceedings of international conference on machine learning; p. 5708\u20135717"},{"key":"463_CR11","unstructured":"Jin W, Barzilay R, Jaakkola T (2018) Junction tree variational autoencoder for molecular graph generation. In: Proceedings of International Conference on Machine Learning; p. 2323\u20132332"},{"key":"463_CR12","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1186\/s13321-019-0396-x","volume":"11","author":"Y Kwon","year":"2019","unstructured":"Kwon Y, Yoo J, Choi YS, Son WJ, Lee D, Kang S (2019) Efficient learning of non-autoregressive graph variational autoencoders for molecular graph generation. J Cheminf 11:70","journal-title":"J Cheminf"},{"key":"463_CR13","unstructured":"Gilmer J, Schoenholz SS, Riley PF, Vinyals O, Dahl GE (2017) Neural message passing for quantum chemistry. In: Proceedings of international conference on machine learning; p. 1263\u20131272"},{"issue":"3","key":"463_CR14","doi-asserted-by":"crossref","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(3):1096\u20131108","journal-title":"J Chem Inf Model"},{"key":"463_CR15","doi-asserted-by":"crossref","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:120\u2013131","journal-title":"ACS Cent Sci"},{"issue":"2","key":"463_CR16","doi-asserted-by":"crossref","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, Hern\u00e1ndez-Lobato JM, S\u00e1nchez-Lengeling B, Sheberla D et al (2018) Automatic chemical design using a data-driven continuous representation of molecules. ACS Cent Sci 4(2):268\u2013276","journal-title":"ACS Cent Sci"},{"issue":"10","key":"463_CR17","doi-asserted-by":"crossref","first-page":"4398","DOI":"10.1021\/acs.molpharmaceut.8b00839","volume":"15","author":"D Polykovskiy","year":"2018","unstructured":"Polykovskiy D, Zhebrak A, Vetrov D, Ivanenkov Y, Aladinskiy V, Mamoshina P et al (2018) Entangled conditional adversarial autoencoder for De Novo drug discovery. Mol Pharm 15(10):4398\u20134405","journal-title":"Mol Pharm"},{"key":"463_CR18","unstructured":"Guimaraes GL, Sanchez-Lengeling B, Farias PLC, Aspuru-Guzik A (2017) Objective-reinforced generative adversarial networks (ORGAN) for sequence generation models. arXiv preprint arXiv:170510843"},{"issue":"12","key":"463_CR19","doi-asserted-by":"crossref","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(12):3567\u20133572","journal-title":"Chem Sci"}],"container-title":["Journal of Cheminformatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s13321-020-00463-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1186\/s13321-020-00463-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-00463-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,22]],"date-time":"2021-09-22T23:23:26Z","timestamp":1632353006000},"score":1,"resource":{"primary":{"URL":"https:\/\/jcheminf.biomedcentral.com\/articles\/10.1186\/s13321-020-00463-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,9,23]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2020,12]]}},"alternative-id":["463"],"URL":"https:\/\/doi.org\/10.1186\/s13321-020-00463-2","relation":{},"ISSN":["1758-2946"],"issn-type":[{"value":"1758-2946","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,9,23]]},"assertion":[{"value":"22 July 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 September 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 September 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":"58"}}