The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
BEGAN: Boltzmann-Reweighted Data Augmentation for Enhanced GAN-Based Molecule Design in Insect Pheromone Receptors
Open accessPublished version of a preprint
Abstract
Identifying molecules that bind strongly to target proteins in rational drug design is crucial. Machine learning techniques, such as generative adversarial networks (GAN), are now essential tools for generating such molecules. In this study, we present an enhanced method for molecule generation using objective-reinforced GANs. Specifically, we introduce BEGAN (Boltzmann-Enhanced GAN), a novel approach that adjusts molecule occurrence frequencies during training based on the Boltzmann distribution exp(−∆U/τ), where ∆U represents the estimated binding free energy derived from docking algorithms and τ is a temperature-related scaling hyperparameter. This Boltzmann reweighting process shifts the generation process towards molecules with higher binding affinities, allowing the GAN to explore molecular spaces with superior binding properties. The reweighting process can also be refined through multiple iterations without altering the overall distribution shape. To validate our approach, we apply it to the design of sex pheromone analogs targeting Spodoptera frugiperda pheromone receptor SfruOR16, illustrating that the Boltzmann reweighting significantly increases the likelihood of generating promising sex pheromone analogs with improved binding affinities to SfruOR16, further supported by atomistic molecular dynamics simulations. Furthermore, we conduct a comprehensive investigation into parameter dependencies and propose a reasonable range for the hyperparameter τ. Our method offers a promising approach for optimizing molecular generation for enhanced protein binding, potentially increasing the efficiency of drug discovery pipelines.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Highly accurate protein structure prediction with AlphaFold
Jumper, J., Evans, R., Pritzel, A., Green, T., Figurnov, M., Ronneberger, O., Tunyasuvunakool, K., Bates, R., Žídek, A., Potapenko, A., et al. (2021) · Nature · doi:10.1038/s41586-021-03819-2 · Cited by 43,764
Research works printed but not linked: 47
- 10.1021/acs.jcim.1c00203 · DOI
- 10.3390/molecules27093041 · DOI
- 10.1093/bib/bbab344 · DOI
- 10.1038/s43588-023-00530-2 · DOI
- National Library of Medicine (US) PubChem. 2004. https://pubchem.ncbi.nlm.nih.gov/ (accessed Nov 2, 2024).
- 10.1021/acs.jcim.0c00675 · DOI
- 10.1007/BF00126217 · DOI
- Xie, Y.; Shi, C.; Zhou, H.; Yang, Y.; Zhang, W.; Yu, Y.; Li, L. MARS: Markov molecular sampling for multi-objective drug discovery. In ICLR 2021─9th International Conference on Learning Representations , 2021.
- 10.1038/s42004-022-00754-9 · DOI
- 10.26434/chemrxiv.5309668.v3 · DOI
- 10.1039/D1SC00163A · DOI
- 10.1021/acs.jcim.9b01120 · DOI
- 10.1186/s13321-021-00565-5 · DOI
- 10.1093/bioinformatics/btaa219 · DOI
- Zhang, H.; Zhao, H.; Zhang, X.; Su, Q.; Du, H.; Shen, C.; Wang, Z.; Li, D.; Pan, P.; Chen, G.; Kang, Y.; Hsieh, C.Y.; Hou, T. Delete: deep lead optimization enveloped in protein pocket through unified deleting strategies and a structure-aware network. 2023, arXiv:abs/2308.02172.
- Goodfellow, I. J.; Pouget-Abadie, J.; Mirza, M.; Xu, B.; Warde-Farley, D.; Ozair, S.; Courville, A.; Bengio, Y. Generative adversarial networks. 2014, arXiv:abs/1406.2661.
- Yu, L.; Zhang, W.; Wang, J.; Yu, Y. SeqGAN: sequence generative adversarial nets with policy gradient. 2016, arXiv:abs/1609.05473. · DOI
- Guimaraes, G. L.; Sánchez-Lengeling, B.; Farias, P. L. C.; Aspuru-Guzik, A. Objective-reinforced generative adversarial networks (ORGAN) for sequence generation models. 2017, arXiv:abs/1705.10843.
- 10.1016/j.ailsci.2022.100045 · DOI
- 10.1038/nature06850 · DOI
- 10.1007/s00018-023-04837-1 · DOI
- 10.1007/s00018-024-05303-2 · DOI
- 10.1126/science.adn6384 · DOI
- 10.1126/science.adn6881 · DOI
- 10.1146/annurev-cellbio-120123-112853 · DOI
- 10.12140/j.issn.1000-7423.2020.06.013 · DOI
- 10.3389/fevo.2015.00105 · DOI
- 10.1111/1744-7917.13098 · DOI
- 10.1146/annurev.ento.45.1.575 · DOI
- Ando, T.; Inomata, S.I.; Yamamoto, M. In The Chemistry of Pheromones and Other Semiochemicals I ; Topics in Current Chemistry ; Springer Berlin Heidelberg: Berlin, Heidelberg, 2004; pp 51–96. · DOI
- Löfstedt, C.; Wahlberg, N.; Millar, J. G. In Pheromone Communication in Moths ; Allison, J. D., Carde, R. T., Eds. University of California Press: Berkeley, 2019; pp 43–78.
- 10.4039/n09-008 · DOI
- 10.16380/j.kcxb.2020.12.013 · DOI
- 10.1111/1744-7917.13162 · DOI
- 10.1186/1758-2946-4-22 · DOI
- 10.1021/ci00057a005 · DOI · Paper page
- Yang, L.; Zhang, D.; Karniadakis, G. E. Physics-informed generative adversarial networks for stochastic differential equations. 2018, arXiv:abs/1811.02033.
- De Cao, N.; Kipf, T. MolGAN: An implicit generative model for small molecular graphs. 2018, arXiv:abs/1805.11973v2.
- 10.1186/1471-2105-10-168 · DOI
- 10.1002/jcc.20945 · DOI · Paper page
- 10.1038/nmeth.4067 · DOI
- 10.1002/jcc.21367 · DOI
- 10.1016/j.softx.2015.06.001 · DOI · Paper page
- 10.1021/acs.jctc.1c00645 · DOI
- 10.1021/ct300418h · DOI
- 10.3390/insects11030193 · DOI
- 10.1126/science.aaw1147 · DOI
Metadata
- Authors
- Dai, J., Zhang, Y., Shi, C., Liu, Y., Xiu, P., & Wang, Y.
- Affiliations
- Zhejiang University (CN)
- Institute of Plant Protection (CN)
- Corresponding author
- Xiu, Peng
- Wang, Yong
- Venue
- The Journal of Physical Chemistry B
- Publisher
- American Chemical Society (ACS)
- Published
- 2024-11-14
- Volume
- 128
- Issue
- 47
- Pages
- 11666-11675
- ISSN
- 1520-5207 (ISSN-L)
- 1520-6106
- OpenAlex
- W4404375413
- Cited by
- 3
- References
- 1
- Citations by year
- 2026: 2 · 2025: 1
- FWCI
- 0.64
- Type
- journal article
- Language
- en
- Open access
- green
- doi.org
- Licence
- Locations
- The Journal of Physical Chemistry B (publishedVersion)
- bioRxiv (Cold Spring Harbor Laboratory) (acceptedVersion)
- PubMed (publishedVersion)
- Funders
- National Natural Science Foundation of China (11932017, 32371300)
- Natural Science Foundation of Zhejiang Province (LZ24C050003)
- Topics
- Life Sciences › Pharmacology, Toxicology and Pharmaceutics › Drug Discovery › Computational Drug Discovery Methods
- Physical Sciences › Materials Science › Materials Chemistry › Machine Learning in Materials Science
- Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Generative Adversarial Networks and Image Synthesis
- Keywords
- generative adversarial networks, data augmentation, binding free energy, protein-ligand docking, Spodoptera frugiperda, molecular dynamics simulation
- MeSH terms
- Machine Learning, Animals, Spodoptera, Insect Proteins, Receptors, Pheromone, Molecular Dynamics Simulation, Molecular Docking Simulation
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review