No retraction, correction or concern found when last checked on Oct 24, 2026.
Mol-CycleGAN: a generative model for molecular optimization
Łukasz Maziarka, Agnieszka Pocha, Jan Kaczmarczyk and 3 more
Journal of Cheminformatics · 2020 · CC BY
Abstract
Designing a molecule with desired properties is one of the biggest challenges in drug development, as it requires optimization of chemical compound structures with respect to many complex properties. To improve the compound design process, we introduce Mol-CycleGAN—a CycleGAN-based model that generates optimized compounds with high structural similarity to the original ones. Namely, given a molecule our model generates a structurally similar one with an optimized value of the considered property. We evaluate the performance of the model on selected optimization objectives related to structural properties (presence of halogen groups, number of aromatic rings) and to a physicochemical property (penalized logP). In the task of optimization of penalized logP of drug-like molecules our model significantly outperforms previous results.
Full text
Its licence does not allow us to show the full text. Read it at PubMed Central:
Read at PubMed CentralReferences 50
- 1.
Ratti E, Trist D. The continuing evolution of the drug discovery process in the pharmaceutical industry. Farmaco. 2001;56(1–2):13-19.
Not in our library10.1016/s0014-827x(01)01019-9
- 2.
Rao VS, Srinivas K. Modern drug discovery process: an in silico approach. J Bioinform Seq Anal. 2011;2(5):89-94.
Not in our library
- 3.
Bajorath J. Integration of virtual and high-throughput screening. Nat Rev Drug Discov. 2002;1(11):882-894.
Not in our library10.1038/nrd941
- 4.
Lavecchia A, Di Giovanni C. Virtual screening strategies in drug discovery: a critical review. Curr Med Chem. 2013;20(23):2839-2860.
Not in our library10.2174/09298673113209990001
- 5.
Honório KM, Moda TL, Andricopulo AD. Pharmacokinetic properties and in silico adme modeling in drug discovery. J Med Chem. 2013;9(2):163-176.
Not in our library10.2174/1573406411309020002
- 6.
de Ruyck J, Brysbaert G, Blossey R, Lensink MF. Molecular docking as a popular tool in drug design, an in silico travel. Adv Appl Bioinform. 2016;9:1-11.
Not in our library10.2147/aabc.s105289
- 7.
Segler MH, Preuss M, Waller MP. Planning chemical syntheses with deep neural networks and symbolic ai. Nature. 2018;555(7698):604.
Not in our library10.1038/nature25978
- 8.
Chen H, Engkvist O, Wang Y, Olivecrona M, Blaschke T. The rise of deep learning in drug discovery. Drug Discov Today. 2018.
Not in our library10.1016/j.drudis.2018.01.039
- 9.
Duvenaud DK, Maclaurin D, Iparraguirre J, Bombarell R, Hirzel T, Aspuru-Guzik A, Adams RP (2015) Convolutional networks on graphs for learning molecular fingerprints. In: Advand neurology, pp. 2224–2232
Not in our library
- 10.
Jastrzębski S, Leśniak D, Czarnecki WM (2016) Learning to smile (s). arXiv preprint arXiv:1602.06289
Not in our library
- 11.
Coley CW, Barzilay R, Green WH, Jaakkola TS, Jensen KF. Convolutional embedding of attributed molecular graphs for physical property prediction. J Chem Inf Model. 2017;57(8):1757-1772.
Not in our library10.1021/acs.jcim.6b00601
- 12.
Pham T, Tran T, Venkatesh S (2018) Graph memory networks for molecular activity prediction. arXiv preprint arXiv:1801.02622
Not in our library
- 13.
Segler MH, Kogej T, Tyrchan C, Waller MP. Generating focused molecule libraries for drug discovery with recurrent neural networks. ACS Cent Sci. 2017;4(1):120-131.
Not in our library10.1021/acscentsci.7b00512
- 14.
Bjerrum EJ, Threlfall R (2017) Molecular generation with recurrent neural networks (rnns). arXiv preprint arXiv:1705.04612
Not in our library
- 15.
- 16.
Gupta A, Müller AT, Huisman BJ, Fuchs JA, Schneider P, Schneider G. Generative recurrent networks for de novo drug design. Mol Inform. 2018;37(1–2):1700111.
Not in our library10.1002/minf.201700111
- 17.
Arús-Pous J, Blaschke T, Ulander S, Reymond J-L, Chen H, Engkvist O. Exploring the gdb-13 chemical space using deep generative models. J Cheminform. 2019;11(1):20.
Not in our library10.1186/s13321-019-0341-z
- 18.
Popova M, Isayev O, Tropsha A. Deep reinforcement learning for de novo drug design. Sci Adv. 2018;4(7):7885.
Not in our library10.1126/sciadv.aap7885
- 19.
Kusner MJ, Paige B, Hernández-Lobato JM (2017) Grammar variational autoencoder. In: Proceedings of the 34th international conference on machine learning, volume 70, pp. 1945–1954
Not in our library
- 20.
Dai H, Tian Y, Dai B, Skiena S, Song L (2018) Syntax-directed variational autoencoder for structured data. arXiv preprint arXiv:1802.08786
Not in our library
- 21.
- 22.
- 23.
Li Y, Vinyals O, Dyer C, Pascanu R, Battaglia P (2018) Learning deep generative models of graphs. arXiv preprint arXiv:1803.03324
Not in our library
- 24.
- 25.
Lim J, Hwang S-Y, Kim S, Moon S, Kim WY (2019) Scaffold-based molecular design using graph generative model. arXiv preprint arXiv:1905.13639
Not in our library10.1039/c9sc04503a
- 26.
Kingma DP, Welling M (2013) Auto-encoding variational bayes. arXiv preprint arXiv:1312.6114
Not in our library
- 27.
- 28.
Samanta B, Abir D, Jana G, Chattaraj PK, Ganguly N, Rodriguez MG. Nevae: a deep generative model for molecular graphs. Proc AAAI Conf Artif Intell. 2019;33:1110-1117.
Not in our library
- 29.
Simonovsky M, Komodakis N (2018) Graphvae: towards generation of small graphs using variational autoencoders. arXiv preprint arXiv:1802.03480
Not in our library
- 30.
Jin W, Barzilay R, Jaakkola T (2018) Junction tree variational autoencoder for molecular graph generation. In: Dy, J., Krause, A. (eds.) Proceedings of the 35th international conference on machine learning. Proceedings of machine learning research, vol. 80. PMLR, Stockholmsmässan, Stockholm Sweden, pp. 2323–2332
Not in our library
- 31.
Goodfellow I, Pouget-Abadie J, Mirza M, Xu B, Warde-Farley D, Ozair S, Courville A, Bengio Y (2014) Generative adversarial nets. In: Advance neurology, pp. 2672–2680
Not in our library
- 32.
Guimaraes GL, Sanchez-Lengeling B, Outeiral C, Farias PLC, Aspuru-Guzik A (2017) Objective-reinforced generative adversarial networks (organ) for sequence generation models. arXiv preprint arXiv:1705.10843
Not in our library
- 33.
Sanchez-Lengeling B, Outeiral C, Guimaraes GL, Aspuru-Guzik A (2017) Optimizing distributions over molecular space. In: An objective-reinforced generative adversarial network for inverse-design chemistry (organic)
Not in our library
- 34.
De Cao N, Kipf T (2018) Molgan: an implicit generative model for small molecular graphs. arXiv preprint arXiv:1805.11973
Not in our library
- 35.
You J, Liu B, Ying Z, Pande V, Leskovec J (2018) Graph convolutional policy network for goal-directed molecular graph generation. In: Advances in neural information processing systems, pp. 6410–6421
Not in our library
- 36.
- 37.
Zhu J-Y, Park T, Isola P, Efros AA (2017) Unpaired image-to-image translation using cycle-consistent adversarial networks. In: Proceedings of the IEEE international conference on computer vision, pp. 2223–2232
Not in our library
- 38.
Maziarka Ł, Pocha A, Kaczmarczyk J, Rataj K, Warchoł M, Tetko IV, Kůrková V, Karpov P, Theis F. Mol-cyclegan—a generative model for molecular optimization. Artificial neural networks and machine learning—ICANN 2019: Workshop and Special Sessions. 2019;810-816.
Not in our library
- 39.
Weininger D. Smiles, a chemical language and information system. 1. Introduction to methodology and encoding rules. J Chem Inf Comp Sci. 1988;28(1):31-36.
Not in our library10.1021/ci00057a005
- 40.
Mao X, Li Q, Xie H, Lau RY, Wang Z, Paul Smolley S (2017) Least squares generative adversarial networks. In: 2017 IEEE international conference on computer vision (ICCV), pp. 2794–2802 10.1109/ICCV.2017.304
Not in our library
Cited by papers we hold 2
Reads
Read by people on this page
None yet.
Checked or read by AI through naulon
None yet.
A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.
Are you an author?
Is this your paper?
Claim it to add your note and be paid when agents cite it. Free.