Evidence map›Paper›PMID 24591615›Full record

ArticleProceedings of the National Academy of Sciences of the United States of America2014

Graph-based sampling for approximating global helical topologies of RNA.

Namhee Kim, Christian Laing, Shereef Elmetwaly, Segun Jung, Jeremy Curuksu, Tamar Schlick

Abstract read
In one paragraph

Article in Proceedings of the National Academy of Sciences of the United States of America, 2014. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 48 papers.

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

48 citing papers in PubMed.

  1. Review
  2. Article
  3. Article
  4. Article
  5. Article
  6. Article
  7. Article
  8. Computational tools to study RNA-protein complexes.Frontiers in molecular biosciences · 2022
    Review
  9. Article
  10. Article
  11. RNA 3D Structure Prediction Using Coarse-Grained Models.Frontiers in molecular biosciences · 2021
    Review
  12. Predicting RNA Scaffolds with a Hybrid Method of Vfold3D and VfoldLA.Methods in molecular biology (Clifton, N.J.) · 2021
    Article
  13. Article
  14. Article
  15. Article
  16. Article
  17. Article
  18. Article
  19. Article
  20. 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.

Namhee KimDepartment of Chemistry, New York University, New York, NY 10003.
Christian Laing
Shereef Elmetwaly
Segun Jung
Jeremy Curuksu
Tamar Schlick

Funding

Modeling RNA Tertiary Structure Folding by a Hierarchical FrameworkR01GM100469 · NIGMS · NEW YORK UNIVERSITY · PI SCHLICK, TAMAR · 2011 to 2014
$1.5M
Computational studies of in vitro selection of RNAsR01GM081410 · NIGMS · NEW YORK UNIVERSITY · PI SCHLICK, TAMAR · 2009 to 2012
$1.2M
NIGMS NIH HHS GM081410NIGMS NIH HHS GM100469NIGMS NIH HHS R01 GM081410NIGMS NIH HHS R01 GM100469
6 · The paper itself

Abstract

A current challenge in RNA structure prediction is the description of global helical arrangements compatible with a given secondary structure. Here we address this problem by developing a hierarchical graph sampling/data mining approach to reduce conformational space and accelerate global sampling of candidate topologies. Starting from a 2D structure, we construct an initial graph from size measures deduced from solved RNAs and junction topologies predicted by our data-mining algorithm RNAJAG trained on known RNAs. We sample these graphs in 3D space guided by knowledge-based statistical potentials derived from bending and torsion measures of internal loops as well as radii of gyration for known RNAs. Graph sampling results for 30 representative RNAs are analyzed and compared with reference graphs from both solved structures and predicted structures by available programs. This comparison indicates promise for our graph-based sampling approach for characterizing global helical arrangements in large RNAs: graph rmsds range from 2.52 to 28.24 Å for RNAs of size 25-158 nucleotides, and more than half of our graph predictions improve upon other programs. The efficiency in graph sampling, however, implies an additional step of translating candidate graphs into atomic models. Such models can be built with the same idea of graph partitioning and build-up procedures we used for RNA design.

Indexed as

Models, MolecularNucleic Acid ConformationAlgorithmsComputational BiologyData MiningRNARNA FoldingRNAMonte Carlo simulated annealingRNA 3D graphRNA 3D prediction

Identifiers

PMID24591615
PMCPMC3964109

What OpenQuestion holds

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