Evidence map›Paper›PMID 28334186›Full record

ArticleBioinformatics (Oxford, England)2017

RNAscClust: clustering RNA sequences using structure conservation and graph based motifs.

Milad Miladi, Alexander Junge, Fabrizio Costa, Stefan E Seemann, Jakob Hull Havgaard, Jan Gorodkin, Rolf Backofen

Abstract read
In one paragraph

Article in Bioinformatics (Oxford, England), 2017. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 21 papers.

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

21 citing papers in PubMed.

  1. Article
  2. Article
  3. Genome-Wide RNA Secondary Structure Prediction.Methods in molecular biology (Clifton, N.J.) · 2023
    Article
  4. Reference-based read clustering improves theComputational and structural biotechnology journal · 2023
    Article
  5. Article
  6. Review
  7. Article
  8. The locality dilemma of Sankoff-like RNA alignments.Bioinformatics (Oxford, England) · 2020
    Article
  9. Article
  10. Article
  11. Article
  12. ShaKer: RNA SHAPE prediction using graph kernel.Bioinformatics (Oxford, England) · 2019
    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

7 authors.

Milad MiladiBioinformatics Group, Department of Computer Science, University of Freiburg, Freiburg im Breisgau, Germany.
Alexander JungeCenter for Non-coding RNA in Technology and Health, University of Copenhagen, Frederiksberg, Denmark.
Fabrizio CostaBioinformatics Group, Department of Computer Science, University of Freiburg, Freiburg im Breisgau, Germany.
Stefan E SeemannCenter for Non-coding RNA in Technology and Health, University of Copenhagen, Frederiksberg, Denmark.
Jakob Hull HavgaardCenter for Non-coding RNA in Technology and Health, University of Copenhagen, Frederiksberg, Denmark.
Jan GorodkinCenter for Non-coding RNA in Technology and Health, University of Copenhagen, Frederiksberg, Denmark.
Rolf BackofenBioinformatics Group, Department of Computer Science, University of Freiburg, Freiburg im Breisgau, Germany.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

motivationClustering RNA sequences with common secondary structure is an essential step towards studying RNA function. Whereas structural RNA alignment strategies typically identify common structure for orthologous structured RNAs, clustering seeks to group paralogous RNAs based on structural similarities. However, existing approaches for clustering paralogous RNAs, do not take the compensatory base pair changes obtained from structure conservation in orthologous sequences into account.

resultsHere, we present RNAscClust , the implementation of a new algorithm to cluster a set of structured RNAs taking their respective structural conservation into account. For a set of multiple structural alignments of RNA sequences, each containing a paralog sequence included in a structural alignment of its orthologs, RNAscClust computes minimum free-energy structures for each sequence using conserved base pairs as prior information for the folding. The paralogs are then clustered using a graph kernel-based strategy, which identifies common structural features. We show that the clustering accuracy clearly benefits from an increasing degree of compensatory base pair changes in the alignments. AVAILABILITY AND IMPLEMENTATION: RNAscClust is available at http://www.bioinf.uni-freiburg.de/Software/RNAscClust . CONTACT: gorodkin@rth.dk or backofen@informatik.uni-freiburg.de. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.

Indexed as

SoftwareAlgorithmsCluster AnalysisHumansNucleic Acid ConformationRNASequence Analysis, RNARNA

Identifiers

PMID28334186
PMCPMC5870858

What OpenQuestion holds

Textmetadata
LicenceCC BY-NC
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.