Evidence map›Paper›PMID 30925864›Full record

ArticleBMC bioinformatics2019

RCPred: RNA complex prediction as a constrained maximum weight clique problem.

Audrey Legendre, Eric Angel, Fariza Tahi

Open access · goldAbstract read
In one paragraph

Article in BMC bioinformatics, 2019. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 3 papers.

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

3 citing papers in PubMed, 8 citations in OpenAlex.

  1. Review
  2. Article
  3. 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 at 2 institutions in 1 country.

Audrey LegendreIBISC, Univ Evry, Université Paris-Saclay, Evry, 91025, France.
Eric AngelIBISC, Univ Evry, Université Paris-Saclay, Evry, 91025, France.
Fariza TahiIBISC, Univ Evry, Université Paris-Saclay, Evry, 91025, France. fariza.tahi@univ-evry.fr.
Informatique, Biologie Intégrative et Systèmes Complexes · FRUniversité Paris-Saclay · FR

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

backgroundRNAs can interact and form complexes, which have various biological roles. The secondary structure prediction of those complexes is a first step towards the identification of their 3D structure. We propose an original approach that takes advantage of the high number of RNA secondary structure and RNA-RNA interaction prediction tools. We formulate the problem of RNA complex prediction as the determination of the best combination (according to the free energy) of predicted RNA secondary structures and RNA-RNA interactions.

resultsWe model those predicted structures and interactions as a graph in order to have a combinatorial optimization problem that is a constrained maximum weight clique problem. We propose an heuristic based on Breakout Local Search to solve this problem and a tool, called RCPred, that returns several solutions, including motifs like internal and external pseudoknots. On a large number of complexes, RCPred gives competitive results compared to the methods of the state of the art.

conclusionsWe propose in this paper a method called RCPred for the prediction of several secondary structures of RNA complexes, including internal and external pseudoknots. As further works we will propose an improved computation of the global energy and the insertion of 3D motifs in the RNA complexes.

Indexed as

AlgorithmsDatabases, Nucleic AcidNucleic Acid ConformationRNASequence Analysis, RNARNAMaximum weight clique heuristicPseudoknotRNA complexRNA interactionSecondary structure

Identifiers

PMID30925864
PMCPMC6439972
OpenAlexW2935340325

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.