Evidence map›Paper›PMID 29927936›Full record

ArticlePLoS computational biology2018

Solving the RNA design problem with reinforcement learning.

Peter Eastman, Jade Shi, Bharath Ramsundar, Vijay S Pande

Abstract read
In one paragraph

Article in PLoS computational biology, 2018. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 19 papers.

0numbers the graph read from it
0cells of the map it votes in
19citing 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

19 citing papers in PubMed.

  1. Article
  2. Article
  3. Article
  4. Article
  5. Article
  6. Machine Learning for RNA Design: LEARNA.Methods in molecular biology (Clifton, N.J.) · 2025
    Article
  7. Article
  8. Article
  9. Article
  10. Fitness functions for RNA structure design.Nucleic acids research · 2023
    Article
  11. Review
  12. Article
  13. Review
  14. Article
  15. Article
  16. Scientific Discovery Games for Biomedical Research.Annual review of biomedical data science · 2019
    Article
  17. Article
  18. Review
  19. Review
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

4 authors.

Peter EastmanDepartment of Bioengineering, Stanford University, Stanford, CA, United States of America.ORCID 0000-0002-9566-9684
Jade ShiDepartment of Chemistry, Stanford University, Stanford, CA, United States of America.ORCID 0000-0002-9373-8981
Bharath RamsundarDepartment of Computer Science, Stanford University, Stanford, CA, United States of America.
Vijay S PandeDepartment of Bioengineering, Stanford University, Stanford, CA, United States of America.

Funding

Translational Incubator CoreU19AI109662 · NIAID · STANFORD UNIVERSITY · PI GLENN, JEFFREY S · 2014 to 2019
$28.6M
Topology, nucleation, and the protein folding barrierR01GM062868 · NIGMS · STANFORD UNIVERSITY · PI PANDE, VIJAY S · 2002 to 2018
$5.5M
NIAID NIH HHS U19 AI109662NIGMS NIH HHS R01 GM062868
6 · The paper itself

Abstract

We use reinforcement learning to train an agent for computational RNA design: given a target secondary structure, design a sequence that folds to that structure in silico. Our agent uses a novel graph convolutional architecture allowing a single model to be applied to arbitrary target structures of any length. After training it on randomly generated targets, we test it on the Eterna100 benchmark and find it outperforms all previous algorithms. Analysis of its solutions shows it has successfully learned some advanced strategies identified by players of the game Eterna, allowing it to solve some very difficult structures. On the other hand, it has failed to learn other strategies, possibly because they were not required for the targets in the training set. This suggests the possibility that future improvements to the training protocol may yield further gains in performance.

Indexed as

AlgorithmsComputer-Aided DesignComputer SimulationLearningMachine LearningNucleic Acid ConformationProblem SolvingRNARNA FoldingRNA

Identifiers

PMID29927936
PMCPMC6029810

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.