Evidence map›Paper›PMID 33805944›Full record

ArticleGenes2021

Improving RNA Branching Predictions: Advances and Limitations.

Svetlana Poznanović, Carson Wood, Michael Cloer, Christine Heitsch

Abstract read
In one paragraph

Article in Genes, 2021. 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
–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

2 citing papers in PubMed.

  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.

Svetlana PoznanovićSchool of Mathematical and Statistical Sciences, Clemson University, Clemson, SC 29634, USA.ORCID 0000-0002-8229-8220
Carson WoodSchool of Mathematical and Statistical Sciences, Clemson University, Clemson, SC 29634, USA.ORCID 0000-0002-0526-3075
Michael CloerSchool of Mathematical and Statistical Sciences, Clemson University, Clemson, SC 29634, USA.
Christine HeitschSchool of Mathematics, Georgia Institute of Technology, Atlanta, GA 30308, USA.ORCID 0000-0001-7939-5452

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

Minimum free energy prediction of RNA secondary structures is based on the Nearest Neighbor Thermodynamics Model. While such predictions are typically good, the accuracy can vary widely even for short sequences, and the branching thermodynamics are an important factor in this variance. Recently, the simplest model for multiloop energetics-a linear function of the number of branches and unpaired nucleotides-was found to be the best. Subsequently, a parametric analysis demonstrated that per family accuracy can be improved by changing the weightings in this linear function. However, the extent of improvement was not known due to the ad hoc method used to find the new parameters. Here we develop a branch-and-bound algorithm that finds the set of optimal parameters with the highest average accuracy for a given set of sequences. Our analysis shows that the previous ad hoc parameters are nearly optimal for tRNA and 5S rRNA sequences on both training and testing sets. Moreover, cross-family improvement is possible but more difficult because competing parameter regions favor different families. The results also indicate that restricting the unpaired nucleotide penalty to small values is warranted. This reduction makes analyzing longer sequences using the present techniques more feasible.

Indexed as

AlgorithmsEntropyHumansNucleic Acid ConformationRNARNA, Ribosomal, 5SRNA, TransferThermodynamicsRNARNA, Ribosomal, 5SRNA, Transferbranching parametersmultiloopsNNTMsecondary structure

Identifiers

PMID33805944
PMCPMC8064352

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.