Evidence map›Paper›PMID 38013816›Full record

ReviewDigital discovery2023

Recent advances in the self-referencing embedded strings (SELFIES) library.

Alston Lo, Robert Pollice, AkshatKumar Nigam, Andrew D White, Mario Krenn, Alán Aspuru-Guzik

Abstract readReview
In one paragraph

Review in Digital discovery, 2023. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 9 papers.

0numbers the graph read from it
0cells of the map it votes in
9citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

9 citing papers in PubMed.

  1. Article
  2. Review
  3. Review
  4. Review
  5. Review
  6. Article
  7. Article
  8. Article
  9. Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

6 authors.

Alston LoDepartment of Computer Science, University of Toronto Canada alston.lo@mail.utoronto.ca r.pollice@rug.nl alan@aspuru.com.ORCID https://orcid.org/0000-0003-1744-1446
Robert PolliceDepartment of Computer Science, University of Toronto Canada alston.lo@mail.utoronto.ca r.pollice@rug.nl alan@aspuru.com.ORCID https://orcid.org/0000-0001-8836-6266
AkshatKumar NigamDepartment of Computer Science, Stanford University California USA.
Andrew D WhiteDepartment of Chemical Engineering, University of Rochester USA.ORCID https://orcid.org/0000-0002-6647-3965
Mario KrennMax Planck Institute for the Science of Light (MPL) Erlangen Germany.
Alán Aspuru-GuzikDepartment of Computer Science, University of Toronto Canada alston.lo@mail.utoronto.ca r.pollice@rug.nl alan@aspuru.com.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

String-based molecular representations play a crucial role in cheminformatics applications, and with the growing success of deep learning in chemistry, have been readily adopted into machine learning pipelines. However, traditional string-based representations such as SMILES are often prone to syntactic and semantic errors when produced by generative models. To address these problems, a novel representation, SELF-referencing embedded strings (SELFIES), was proposed that is inherently 100% robust, alongside an accompanying open-source implementation called selfies. Since then, we have generalized SELFIES to support a wider range of molecules and semantic constraints, and streamlined its underlying grammar. We have implemented this updated representation in subsequent versions of selfies, where we have also made major advances with respect to design, efficiency, and supported features. Hence, we present the current status of selfies (version 2.1.1) in this manuscript. Our library, selfies, is available at GitHub (https://github.com/aspuru-guzik-group/selfies).

Identifiers

PMID38013816
PMCPMC10408573

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.