Cited by 24Computational Drug Discovery MethodsMachine Learning in Materials ScienceProtein Degradation and Inhibitors

Sc2Mol: a scaffold-based two-step molecule generator with variational autoencoder and transformer

Open access
Liao, Zhirui, Xie, Lei, Mamitsuka, Hiroshi, Zhu, Shanfeng·2023·Bioinformatics

Abstract

Motivation: Finding molecules with desired pharmaceutical properties is crucial in drug discovery. Generative models can be an efficient tool to find desired molecules through the distribution learned by the model to approximate given training data. Existing generative models (i) do not consider backbone structures (scaffolds), resulting in inefficiency or (ii) need prior patterns for scaffolds, causing bias. Scaffolds are reasonable to use, and it is imperative to design a generative model without any prior scaffold patterns. Results: We propose a generative model-based molecule generator, Sc2Mol, without any prior scaffold patterns. Sc2Mol uses SMILES strings for molecules. It consists of two steps: scaffold generation and scaffold decoration, which are carried out by a variational autoencoder and a transformer, respectively. The two steps are powerful for implementing random molecule generation and scaffold optimization. Our empirical evaluation using drug-like molecule datasets confirmed the success of our model in distribution learning and molecule optimization. Also, our model could automatically learn the rules to transform coarse scaffolds into sophisticated drug candidates. These rules were consistent with those for current lead optimization. Availability and implementation: The code is available at https://github.com/zhiruiliao/Sc2Mol. Supplementary information: Supplementary data are available at Bioinformatics online.

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1093/bioinformatics/btac814

Cites

28 of 28 references verified0 citation errors · 0 not checkable

Statistics

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.

A few free checks a day · papers already verified open instantly · results are public

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • Several research studies propose intricate and expansive architectures to overcome the limitations of conditional VAEs.

    “To overcome these limitations, several research studies35,36 propose intricate and expansive architectures.”

    From PCF-VAE: posterior collapse free variational autoencoder for de novo drug design (2025) · cites this paper as [35]

    The Introduction and §2.1 describe Sc2Mol as a two-step architecture combining a VAE with a transformer, so it is an example of a more elaborate molecule generator. Our copy does not say it was proposed specifically to overcome limitations of conditional VAEs; that motivation is unsupported. (LLM, conf=0.82)

    Experimental — accuracy not yet measured
  • These intricate and expansive architectures attain a SOTA level of validity and diversity in generated molecules but require extended time for completion.

    “Although these architectures attain a SOTA level of validity and diversity in generated molecules, the intricate nature of the process leads to an extension in the time required for completion.”

    From PCF-VAE: posterior collapse free variational autoencoder for de novo drug design (2025) · cites this paper as [35]

    Section 3.5.1, Table 2 reports 100% validity and 99.99% uniqueness for Sc2Mol on MOSES; Section 3.4 identifies uniqueness as a measure of molecular diversity. The cited results support high validity and diversity, but the passages do not establish that architectural complexity extends the time required for completion. (LLM, conf=0.83)

    Experimental — accuracy not yet measured

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Cites

Flagged first, then by citations

Research works printed but not linked: 13

  1. Arjovsky M. et al (2017) Wasserstein Generative Adversarial Networks. In: Proceedings of the 34th International Conference on Machine Learning, Sydney, Australia, pp. 214– 223.
  2. Bowman S.R. et al (2016) Generating sentences from a continuous space. In: Proceedings of the 20th SIGNLL Conference on Computational Natural Language Learning, pp. 10– 21. Association for Computational Linguistics, Berlin, Germany.
  3. Dauphin Y.N. et al (2017) Language modeling with gated convolutional networks. In: Proceedings of the 34th International Conference on Machine Learning, Sydney, Australia, pp. 933– 941.
  4. Dong H.-W. et al (2018) MuseGAN: multi-track sequential generative adversarial networks for symbolic music generation and accompaniment. In: Proceedings of the AAAI Conference on Artificial Intelligence, New Orleans, Louisiana, USA, Vol. 32.
  5. He K. et al (2016) Deep residual learning for image recognition. In: 2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR), pp. 770– 778. IEEE Computer Society, Los Alamitos, CA, USA.
  6. Jin W. et al (2018) Junction tree variational autoencoder for molecular graph generation. In: Dy J. and Krause A., editors, Proceedings of the 35th International Conference on Machine Learning, Volume 80 of Proceedings of Machine Learning Research. PMLR, pp. 2323– 2332.
  7. Karras T. et al (2020) Analyzing and improving the image quality of StyleGAN. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), Seattle, WA, USA, pp. 8110-8119.
  8. Kingma D.P., Ba J. (2015) Adam: a method for stochastic optimization. In: Proceedings of3rd International Conference on Learning Representations, San Diego, CA, USA.
  9. Kingma D.P., Welling M. (2014) Auto-encoding variational Bayes. In: Proceedings of2nd International Conference on Learning Representations, Banff, AB, Canada.
  10. Lei Ba J. et al (2016) Layer normalization. arXiv preprint arXiv:1607.06450. · arXiv
  11. Zang C., Wang F. (2020) Moflow: an invertible flow model for generating molecular graphs. In: Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, New York, NY, USA, pp. 617– 626.
  12. Zhang H. et al (2019) ReCoSa: detecting the relevant contexts with self-attention for multi-turn dialogue generation. In: Proceedings of the 57th Annual Meeting of the Association for Computational Linguistics, pp. 3721– 3730. Association for Computational Linguistics, Florence, Italy
  13. Zhang J. et al (2017) Flexible and creative Chinese poetry generation using neural memory. In: Proceedings of the 55th Annual Meeting of the Association for Computational Linguistics, Volume 1: Long Papers), pp. 1364– 1373. Association for Computational Linguistics, Vancouver, Canada. PMC12007664 40255468

Cited by

Sorted by citations

Authors
Liao, Z., Xie, L., Mamitsuka, H., & Zhu, S.
Affiliations
  • Fudan University (CN)
  • City University of New York (US)
  • Kyoto University (JP)
Corresponding author
Zhu, Shanfeng
Venue
Bioinformatics
Published
2022-12-28
Volume
39
Issue
1
ISSN
  • 1367-4803 (ISSN-L)
  • 1367-4811
OpenAlex
W4313236609
Cited by
24
References
28
Citations by year
2026: 5 · 2025: 9 · 2024: 7 · 2023: 3
FWCI
2.57
Type
journal article
Language
en
Open access
Locations
  • Bioinformatics (publishedVersion, cc-by)
  • PubMed Central (publishedVersion, cc-by)
  • PubMed (publishedVersion)
  • Institutional Repositories DataBase (IRDB) (submittedVersion, cc-by)
  • Aaltodoc (Aalto University) (submittedVersion, cc-by)
  • Kyoto University Research Information Repository (Kyoto University) (submittedVersion, cc-by)
Funders
National Natural Science Foundation of China (62272105)
Topics
  • Physical Sciences › Computer Science › Computational Theory and Mathematics › Computational Drug Discovery Methods
  • Physical Sciences › Materials Science › Materials Chemistry › Machine Learning in Materials Science
  • Life Sciences › Biochemistry, Genetics and Molecular Biology › Molecular Biology › Protein Degradation and Inhibitors
Keywords
molecular generation, scaffold optimization, variational autoencoder, transformer models, SMILES, drug-like molecules, lead optimization
MeSH terms
Machine Learning, Drug Discovery

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