Evidence map›Paper›PMID 36026505›Full record

ArticlePLoS computational biology2022

RAFFT: Efficient prediction of RNA folding pathways using the fast Fourier transform.

Vaitea Opuu, Nono S C Merleau, Vincent Messow, Matteo Smerlak

Open access · goldAbstract read
In one paragraph

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

0numbers the graph read from it
0cells of the map it votes in
2citing papers in PubMed
0.2field-weighted citation impact, top 52% of its field
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

2 citing papers in PubMed, 3 citations in OpenAlex.

  1. Article
  2. 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

4 authors at 1 institution in 1 country.

Vaitea OpuuMax Planck Institute for Mathematics in the Sciences, Leipzig, Germany.ORCID 0000-0001-8364-5098
Nono S C MerleauMax Planck Institute for Mathematics in the Sciences, Leipzig, Germany.ORCID 0000-0003-3150-6250
Vincent MessowMax Planck Institute for Mathematics in the Sciences, Leipzig, Germany.ORCID 0000-0002-4467-8804
Matteo SmerlakMax Planck Institute for Mathematics in the Sciences, Leipzig, Germany.ORCID 0000-0002-0844-8868
Max Planck Institute for Mathematics in the Sciences · DE

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

We propose a novel heuristic to predict RNA secondary structure formation pathways that has two components: (i) a folding algorithm and (ii) a kinetic ansatz. This heuristic is inspired by the kinetic partitioning mechanism, by which molecules follow alternative folding pathways to their native structure, some much faster than others. Similarly, our algorithm RAFFT starts by generating an ensemble of concurrent folding pathways ending in multiple metastable structures, which is in contrast with traditional thermodynamic approaches that find single structures with minimal free energies. When we constrained the algorithm to predict only 50 structures per sequence, near-native structures were found for RNA molecules of length ≤ 200 nucleotides. Our heuristic has been tested on the coronavirus frameshifting stimulation element (CFSE): an ensemble of 68 distinct structures allowed us to produce complete folding kinetic trajectories, whereas known methods require evaluating millions of sub-optimal structures to achieve this result. Thanks to the fast Fourier transform on which RAFFT (RNA folding Algorithm wih Fast Fourier Transform) is based, these computations are efficient, with complexity [Formula: see text].

Indexed as

RNARNA FoldingAlgorithmsFourier AnalysisNucleic Acid ConformationThermodynamicsRNA

Identifiers

PMID36026505
PMCPMC9455880
OpenAlexW4293795540

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.