Solving the RNA design problem with reinforcement learning

N/ACitations
Citations of this article
112Readers
Mendeley users who have this article in their library.

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.

Cite

CITATION STYLE

APA

Eastman, P., Shi, J., Ramsundar, B., & Pande, V. S. (2018). Solving the RNA design problem with reinforcement learning. PLoS Computational Biology, 14(6). https://doi.org/10.1371/journal.pcbi.1006176

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free