Evidence map›Paper›PMID 31874236›Full record

ArticleJournal of structural biology2020

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

Swati Jain, Yunwen Tao, Tamar Schlick

Abstract read
In one paragraph

Article in Journal of structural biology, 2020. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 22 papers.

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

22 citing papers in PubMed.

  1. Article
  2. Review
  3. Article
  4. Article
  5. Article
  6. Article
  7. Article
  8. Heterogeneous and multiple conformational transition pathways between pseudoknots of the SARS-CoV-2 frameshift element.Proceedings of the National Academy of Sciences of the United States of America · 2025
    Article
  9. Article
  10. Article
  11. Evolution of coronavirus frameshifting elements: Competing stem networks explain conservation and variability.Proceedings of the National Academy of Sciences of the United States of America · 2023
    Article
  12. Article
  13. Article
  14. Article
  15. Article
  16. Article
  17. Article
  18. Article
  19. Article
  20. A Fiedler Vector Scoring Approach for Novel RNA Motif Selection.The journal of physical chemistry. B · 2021
    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

3 authors.

Swati JainDepartment of Chemistry, New York University, 1021 Silver, 100 Washington Square East, New York, NY 10003, USA.
Yunwen TaoDepartment of Chemistry, New York University, 1021 Silver, 100 Washington Square East, New York, NY 10003, USA.
Tamar SchlickDepartment of Chemistry, New York University, 1021 Silver, 100 Washington Square East, New York, NY 10003, USA; Courant Institute of Mathematical Sciences, New York University, 251 Mercer Street, New York, NY 10012, USA; NYU-ECNU Center for Computational Chemistry at New York University Shanghai, Room 340, Geography Building, North Zhongshan Road, 3663 Shanghai, China. Electronic address: schlick@nyu.edu.

Funding

Bridging Disparate Structural/Functional Scales: Multiscale Modeling of the Chromatin Fiber and RNA Tertiary StructuresR35GM122562 · NIGMS · NEW YORK UNIVERSITY · PI Tamar Schlick · 2017 to 2026
$4.6M
NIGMS NIH HHS R35 GM122562
6 · The paper itself

Abstract

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, opening the usage of graph theory methods to study, predict, and design RNA structures. Our recently developed computational pipeline for design utilizes graph partitioning (RAG-3D) and atomic fragment assembly (F-RAG) to design sequences to fold onto RNA-like tree graph topologies; the atomic fragments are taken from existing RNA structures that correspond to tree subgraphs. Because F-RAG may not produce the target folds for all designs, automated mutations by RAG-IF algorithm enhance the candidate pool markedly. The crucial residues for mutation are identified by differences between the predicted and the target topology. A genetic algorithm then mutates the selected residues, and the successful sequences are optimized to retain only the minimal or essential mutations. Here we evaluate RAG-IF for 6 RNA-like topologies and generate a large pool of successful candidate sequences with a variety of minimal mutations. We find that RAG-IF adds robustness and efficiency to our RNA design pipeline, making inverse folding motivated by graph topology rather than secondary structure more productive.

Indexed as

Nucleic Acid ConformationAlgorithmsComputational BiologyModels, MolecularMutationRNARNAAutomatic mutationsGenetic algorithmRNA As GraphsRNA-like topologyRNA sequence design

Identifiers

PMID31874236
PMCPMC7042079

What OpenQuestion holds

Textmetadata
LicenceTDM
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.