Inverse folding with RNA-As-Graphs produces a large pool of candidate sequences with target topologies.

Abstract excerpt

We present an RNA-As-Graphs (RAG) based inverse folding algorithm, RAG-IF, to design novel RNA sequences that fold onto target tree graph topologies. The algorithm can be used to enhance our recently reported computational design pipeline (Jain et al., NAR 2018). The RAG approach represents RNA secondary structures as tree and dual graphs, where RNA loops and helices are coarse-grained as vertices and edges,...

Topics

Share this publication in a Topic to start or enrich a Post.

• Share to Algorithms
• Share to Computational Biology
• Share to Models, Molecular