scholarly journals BRASERO: A Resource for Benchmarking RNA Secondary Structure Comparison Algorithms

2012 ◽  
Vol 2012 ◽  
pp. 1-5 ◽  
Author(s):  
Julien Allali ◽  
Cédric Saule ◽  
Cédric Chauve ◽  
Yves d’Aubenton-Carafa ◽  
Alain Denise ◽  
...  

The pairwise comparison of RNA secondary structures is a fundamental problem, with direct application in mining databases for annotating putative noncoding RNA candidates in newly sequenced genomes. An increasing number of software tools are available for comparing RNA secondary structures, based on different models (such as ordered trees or forests, arc annotated sequences, and multilevel trees) and computational principles (edit distance, alignment). We describe here the website BRASERO that offers tools for evaluating such software tools on real and synthetic datasets.

2017 ◽  
Author(s):  
Michela Quadrini ◽  
Luca Tesei ◽  
Emanuela Merelli ◽  

The methods proposed in the literature for RNA comparison focus mainly on pseudoknot free structures. The comparison of pseudoknotted structures is still a challenge. In this work, we propose a new algebraic representation of RNA secondary structures based on relations among hairpins in terms of nesting, crossing, and concatenation. Such algebraic representation is obtained from a defined multiple context-free grammar, which maps any kind of RNA secondary structures into extended trees, i.e., ordered trees where internal nodes are labeled with algebraic operators and leaves are labeled with loops. These extended trees permit the definition of the RNA secondary structure comparison as a tree alignment problem.


2017 ◽  
Author(s):  
Michela Quadrini ◽  
Luca Tesei ◽  
Emanuela Merelli ◽  

The methods proposed in the literature for RNA comparison focus mainly on pseudoknot free structures. The comparison of pseudoknotted structures is still a challenge. In this work, we propose a new algebraic representation of RNA secondary structures based on relations among hairpins in terms of nesting, crossing, and concatenation. Such algebraic representation is obtained from a defined multiple context-free grammar, which maps any kind of RNA secondary structures into extended trees, i.e., ordered trees where internal nodes are labeled with algebraic operators and leaves are labeled with loops. These extended trees permit the definition of the RNA secondary structure comparison as a tree alignment problem.


2018 ◽  
Vol 13 (5) ◽  
pp. 450-460 ◽  
Author(s):  
Xingli Guo ◽  
Lin Gao ◽  
Yu Wang ◽  
David K.Y. Chiu ◽  
Bingbo Wang ◽  
...  

10.29007/bhsr ◽  
2020 ◽  
Author(s):  
Mutlu Mete ◽  
Abdullah Arslan

This study is part of our perpetual effort to develop improved RNA secondary structure analysis tools and databases. In this work we present a new Graphical Processing Unit (GPU)-based RNA structural analysis framework that supports fast multiple RNA secondary structure comparison for very large databases. A search-based secondary structure comparison algorithm deployed in RNASSAC website helps bioinformaticians find common RNA substructures from the underlying database. The algorithm performs two levels of binary searches on the database. Its time requirement is affected by the database size. Experiments on the RNASSAC website show that the algorithm takes seconds for a database of 4,666 RNAs. For example, it takes about 4.4 sec for comparing 25 RNAs from this database. In another case, when many non-overlapping common substructures are desired, a heuristic approach requires as long as 85 sec in comparing 40 RNAs from the same database. The comparisons by this sequential algorithm takes at least 50% more time when RNAs are compared from the database of several millions of RNAs. The most recently curated databases already have millions of RNA secondary structures. The improvement in run-time performance of comparison algorithms is necessary. This study present a GPU-based RNA substructure comparison algorithm with which running time for multiple RNA secondary structures remains feasible for large databases. Our new parallel algorithm is 12 times faster than the CPU version (sequential) comparison algorithm of the RNASSAC website. The response time significantly reduces towards development of a realtime RNA comparison web service for bioinformatics community.


Complexity ◽  
2021 ◽  
Vol 2021 ◽  
pp. 1-15
Author(s):  
Lina Yang ◽  
Yang Liu ◽  
Xiaochun Hu ◽  
Patrick Wang ◽  
Xichun Li ◽  
...  

In organisms, ribonucleic acid (RNA) plays an essential role. Its function is being discovered more and more. Due to the conserved nature of RNA sequences, its function mainly depends on the RNA secondary structure. The discovery of an approximate relationship between two RNA secondary structures helps to understand their functional relationship better. It is an important and urgent task to explore structural similarities from the graphical representation of RNA secondary structures. In this paper, a novel graphical analysis method based on the triple vector curve representation of RNA secondary structures is proposed. A combinational method involving a discrete wavelet transform (DWT) and fractal dimension with sliding window is introduced to analyze and compare the graphs derived from feature extraction; after that, the distance matrix is generated. Then, the distance matrix is analyzed by clustering and visualized as a clustering tree. RNA virus and noncoding RNA datasets are applied to perform experiments and analyze the clustering tree. The results show that the proposed method yields more accurate results in the comparison of RNA secondary structures.


RNA ◽  
2016 ◽  
Vol 22 (11) ◽  
pp. 1739-1749 ◽  
Author(s):  
Knut I. Kristiansen ◽  
Ragnhild Weel-Sneve ◽  
James A. Booth ◽  
Magnar Bjørås

2016 ◽  
Vol 31 (3) ◽  
pp. 78-85 ◽  
Author(s):  
Qingfeng Chen ◽  
Yi-Ping Phoebe Chen ◽  
Chengqi Zhang

PLoS ONE ◽  
2011 ◽  
Vol 6 (6) ◽  
pp. e20561 ◽  
Author(s):  
Paul M. Krzyzanowski ◽  
Feodor D. Price ◽  
Enrique M. Muro ◽  
Michael A. Rudnicki ◽  
Miguel A. Andrade-Navarro

Sign in / Sign up

Export Citation Format

Share Document