Algorithm For RNA Secondary Structure Prediction Research Articles

SincFold: end-to-end learning of short- and long-range interactions in RNA secondary structure.

Coding and noncoding RNA molecules participate in many important biological processes. Noncoding RNAs fold into well-defined secondary structures to exert their functions. However, the computational prediction of the secondary structure from a raw RNA sequence is a long-standing unsolved problem, which after decades of almost unchanged performance has now re-emerged due to deep learning. Traditional RNA secondary structure prediction algorithms have been mostly based on thermodynamic models and dynamic programming for free energy minimization. More recently deep learning methods have shown competitive performance compared with the classical ones, but there is still a wide margin for improvement. In this work we present sincFold, an end-to-end deep learning approach, that predicts the nucleotides contact matrix using only the RNA sequence as input. The model is based on 1D and 2D residual neural networks that can learn short- and long-range interaction patterns. We show that structures can be accurately predicted with minimal physical assumptions. Extensive experiments were conducted on several benchmark datasets, considering sequence homology and cross-family validation. sincFold was compared with classical methods and recent deep learning models, showing that it can outperform the state-of-the-art methods.

Mono-valent salt corrections for RNA secondary structures in the ViennaRNA package

BackgroundRNA features a highly negatively charged phosphate backbone that attracts a cloud of counter-ions that reduce the electrostatic repulsion in a concentration dependent manner. Ion concentrations thus have a large influence on folding and stability of RNA structures. Despite their well-documented effects, salt effects are not handled consistently by currently available secondary structure prediction algorithms. Combining Debye-Hückel potentials for line charges and Manning’s counter-ion condensation theory, Einert et al. (Biophys J 100: 2745-2753, 2011) modeled the energetic contributions of monovalent cations on loops and helices.ResultsThe model of Einert et al. is adapted to match the structure of the dynamic programming recursion of RNA secondary structure prediction algorithms. An empirical term describing the salt dependence of the duplex initiation energy is added to improve co-folding predictions for two or more RNA strands. The slightly modified model is implemented in the ViennaRNA package in such way that only the energy parameters but not the algorithmic structure is affected. A comparison with data from the literature show that predicted free energies and melting temperatures are in reasonable agreement with experiments.ConclusionThe new feature in the ViennaRNA package makes it possible to study effects of salt concentrations on RNA folding in a systematic manner. Strictly speaking, the model pertains only to mono-valent cations, and thus covers the most important parameter, i.e., the NaCl concentration. It remains a question for future research to what extent unspecific effects of bi- and tri-valent cations can be approximated in a similar manner.AvailabilityCorrections for the concentration of monovalent cations are available in the ViennaRNA package starting from version 2.6.0.

RNA independent fragment partition method based on deep learning for RNA secondary structure prediction

The non-coding RNA secondary structure largely determines its function. Hence, accuracy in structure acquisition is of great importance. Currently, this acquisition primarily relies on various computational methods. The prediction of the structures of long RNA sequences with high precision and reasonable computational cost remains challenging. Here, we propose a deep learning model, RNA-par, which could partition an RNA sequence into several independent fragments (i-fragments) based on its exterior loops. Each i-fragment secondary structure predicted individually could be further assembled to acquire the complete RNA secondary structure. In the examination of our independent test set, the average length of the predicted i-fragments was 453 nt, which was considerably shorter than that of complete RNA sequences (848 nt). The accuracy of the assembled structures was higher than that of the structures predicted directly using the state-of-the-art RNA secondary structure prediction methods. This proposed model could serve as a preprocessing step for RNA secondary structure prediction for enhancing the predictive performance (especially for long RNA sequences) and reducing the computational cost. In the future, predicting the secondary structure of long-sequence RNA with high accuracy can be enabled by developing a framework combining RNA-par with various existing RNA secondary structure prediction algorithms. Our models, test codes and test data are provided at https://github.com/mianfei71/RNAPar.

Efficient Generation of RNA Secondary Structure Prediction Algorithm Under PAR Framework.

Prediction of RNA secondary structure is an important part of bioinformatics genomics research. Mastering RNA secondary structure can help us to better analyze protein synthesis, cell differentiation, metabolism, and genetic processes and thus reveal the genetic laws of organisms. Comparative sequence analysis, support vector machine, centroid method, and other algorithms in RNA secondary structure prediction algorithms often use dynamic programming algorithm to predict RNA secondary structure because of their huge time and space consumption and complex data structure. In this article, the domain of RNA secondary structure prediction algorithm based on dynamic programming (DP-SSP) is analyzed in depth, and the domain features are modeled. According to the generative programming method, the DP-SSP algorithm components are interactively designed. With the support of PAR platform, the DP-SSP algorithm component library is formally realized. Finally, the concrete algorithm is generated through component assembly, which improves the efficiency and reliability of algorithm development.

UFold: fast and accurate RNA secondary structure prediction with deep learning.

For many RNA molecules, the secondary structure is essential for the correct function of the RNA. Predicting RNA secondary structure from nucleotide sequences is a long-standing problem in genomics, but the prediction performance has reached a plateau over time. Traditional RNA secondary structure prediction algorithms are primarily based on thermodynamic models through free energy minimization, which imposes strong prior assumptions and is slow to run. Here, we propose a deep learning-based method, called UFold, for RNA secondary structure prediction, trained directly on annotated data and base-pairing rules. UFold proposes a novel image-like representation of RNA sequences, which can be efficiently processed by Fully Convolutional Networks (FCNs). We benchmark the performance of UFold on both within- and cross-family RNA datasets. It significantly outperforms previous methods on within-family datasets, while achieving a similar performance as the traditional methods when trained and tested on distinct RNA families. UFold is also able to predict pseudoknots accurately. Its prediction is fast with an inference time of about 160 ms per sequence up to 1500 bp in length. An online web server running UFold is available at https://ufold.ics.uci.edu. Code is available at https://github.com/uci-cbcl/UFold.

ATTfold: RNA Secondary Structure Prediction With Pseudoknots Based on Attention Mechanism.

Accurate RNA secondary structure information is the cornerstone of gene function research and RNA tertiary structure prediction. However, most traditional RNA secondary structure prediction algorithms are based on the dynamic programming (DP) algorithm, according to the minimum free energy theory, with both hard and soft constraints. The accuracy is particularly dependent on the accuracy of soft constraints (from experimental data like chemical and enzyme detection). With the elongation of the RNA sequence, the time complexity of DP-based algorithms will increase geometrically, as a result, they are not good at coping with relatively long sequences. Furthermore, due to the complexity of the pseudoknots structure, the secondary structure prediction method, based on traditional algorithms, has great defects which cannot predict the secondary structure with pseudoknots well. Therefore, few algorithms have been available for pseudoknots prediction in the past. The ATTfold algorithm proposed in this article is a deep learning algorithm based on an attention mechanism. It analyzes the global information of the RNA sequence via the characteristics of the attention mechanism, focuses on the correlation between paired bases, and solves the problem of long sequence prediction. Moreover, this algorithm also extracts the effective multi-dimensional features from a great number of RNA sequences and structure information, by combining the exclusive hard constraints of RNA secondary structure. Hence, it accurately determines the pairing position of each base, and obtains the real and effective RNA secondary structure, including pseudoknots. Finally, after training the ATTfold algorithm model through tens of thousands of RNA sequences and their real secondary structures, this algorithm was compared with four classic RNA secondary structure prediction algorithms. The results show that our algorithm significantly outperforms others and more accurately showed the secondary structure of RNA. As the data in RNA sequence databases increase, our deep learning-based algorithm will have superior performance. In the future, this kind of algorithm will be more indispensable.

An efficient simulated annealing algorithm for the RNA secondary structure prediction with Pseudoknots

BackgroundRNA pseudoknot structures play an important role in biological processes. However, existing RNA secondary structure prediction algorithms cannot predict the pseudoknot structure efficiently. Although random matching can improve the number of base pairs, these non-consecutive base pairs cannot make contributions to reduce the free energy.ResultIn order to improve the efficiency of searching procedure, our algorithm take consecutive base pairs as the basic components. Firstly, our algorithm calculates and archive all the consecutive base pairs in triplet data structure, if the number of consecutive base pairs is greater than given minimum stem length. Secondly, the annealing schedule is adapted to select the optimal solution that has minimum free energy. Finally, the proposed algorithm is evaluated with the real instances in PseudoBase.ConclusionThe experimental results have been demonstrated to provide a competitive and oftentimes better performance when compared against some chosen state-of-the-art RNA structure prediction algorithms.

A New Method of RNA Secondary Structure Prediction Based on Convolutional Neural Network and Dynamic Programming.

In recent years, obtaining RNA secondary structure information has played an important role in RNA and gene function research. Although some RNA secondary structures can be gained experimentally, in most cases, efficient, and accurate computational methods are still needed to predict RNA secondary structure. Current RNA secondary structure prediction methods are mainly based on the minimum free energy algorithm, which finds the optimal folding state of RNA in vivo using an iterative method to meet the minimum energy or other constraints. However, due to the complexity of biotic environment, a true RNA structure always keeps the balance of biological potential energy status, rather than the optimal folding status that meets the minimum energy. For short sequence RNA its equilibrium energy status for the RNA folding organism is close to the minimum free energy status; therefore, the minimum free energy algorithm for predicting RNA secondary structure has higher accuracy. Nevertheless, in a longer sequence RNA, constant folding causes its biopotential energy balance to deviate far from the minimum free energy status. This deviation is because of its complex structure and results in a serious decline in the prediction accuracy of its secondary structure. In this paper, we propose a novel RNA secondary structure prediction algorithm using a convolutional neural network model combined with a dynamic programming method to improve the accuracy with large-scale RNA sequence and structure data. We analyze current experimental RNA sequences and structure data to construct a deep convolutional network model, and then we extract implicit features of an effective classification from large-scale data to predict the pairing probability of each base in an RNA sequence. For the obtained probabilities of RNA sequence base pairing, an enhanced dynamic programming method is applied to obtain the optimal RNA secondary structure. Results indicate that our proposed method is superior to the common RNA secondary structure prediction algorithms in predicting three benchmark RNA families. Based on the characteristics of deep learning algorithm, it can be inferred that the method proposed in this paper has a 30% higher prediction success rate when compared with other algorithms, which will be needed as the amount of real RNA structure data increases in the future.

Transcending the prediction paradigm: novel applications of SHAPE to RNA function and evolution.

Selective 2′‐hydroxyl acylation analyzed by primer extension (SHAPE) provides information on RNA structure at single‐nucleotide resolution. It is most often used in conjunction with RNA secondary structure prediction algorithms as a probabilistic or thermodynamic restraint. With the recent advent of ultra‐high‐throughput approaches for collecting SHAPE data, the applications of this technology are extending beyond structure prediction. In this review, we discuss recent applications of SHAPE data in the transcriptomic context and how this new experimental paradigm is changing our understanding of these experiments and RNA folding in general. SHAPE experiments probe both the secondary and tertiary structure of an RNA, suggesting that model‐free approaches for within and comparative RNA structure analysis can provide significant structural insight without the need for a full structural model. New methods incorporating SHAPE at different nucleotide resolutions are required to parse these transcriptomic data sets to transcend secondary structure modeling with global structural metrics. These ‘multiscale’ approaches provide deeper insights into RNA global structure, evolution, and function in the cell. WIREs RNA 2017, 8:e1374. doi: 10.1002/wrna.1374For further resources related to this article, please visit the WIREs website.

RNAComposer and RNA 3D structure prediction for nanotechnology

RNAs adopt specific, stable tertiary architectures to perform their activities. Knowledge of RNA tertiary structure is fundamental to understand RNA functions beginning with transcription and ending with turnover. Contrary to advanced RNA secondary structure prediction algorithms, which allow good accuracy when experimental data are integrated into the prediction, tertiary structure prediction of large RNAs still remains a significant challenge. However, the field of RNA tertiary structure prediction is rapidly developing and new computational methods based on different strategies are emerging.RNAComposer is a user-friendly and freely available server for 3D structure prediction of RNA up to 500 nucleotide residues. RNAComposer employs fully automated fragment assembly based on RNA secondary structure specified by the user. Importantly, this method allows incorporation of distance restraints derived from the experimental data to strengthen the 3D predictions. The potential and limitations of RNAComposer are discussed and an application to RNA design for nanotechnology is presented.

Probing-directed identification of novel structured RNAs

ABSTRACTTranscripts often harbor RNA elements, which regulate cell processes co- or post-transcriptionally. The functions of many regulatory RNA elements depend on their structure, thus it is important to determine the structure as well as to scan genomes for structured elements. State of the art ab initio approaches to predict structured RNAs rely on DNA sequence analysis. They use 2 major types of information inferred from a sequence: thermodynamic stability of an RNA structure and evolutionary footprints of base-pair interactions. In recent years, chemical probing of RNA has arisen as an alternative source of structural information. RNA probing experiments detect positions accessible to specific types of chemicals or enzymes indicating their propensity to be in a paired or unpaired state. There exist several strategies to integrate probing data into RNA secondary structure prediction algorithms that substantially improve the prediction quality. However, whether and how probing data could contribute to detection of structured RNAs remains an open question. We previously developed the energy-based approach RNASurface to detect locally optimal structured RNA elements. Here, we integrate probing data into the RNASurface energy model using a general framework. We show that the use of experimental data allows for better discrimination of ncRNAs from other transcripts. Application of RNASurface to genome-wide analysis of the human transcriptome with PARS data identifies previously undetectable segments, with evidence of functionality for some of them.

SHAPE directed RNA folding.

Summary: Chemical mapping experiments allow for nucleotide resolution assessment of RNA structure. We demonstrate that different strategies of integrating probing data with thermodynamics-based RNA secondary structure prediction algorithms can be implemented by means of soft constraints. This amounts to incorporating suitable pseudo-energies into the standard energy model for RNA secondary structures. As a showcase application for this new feature of the ViennaRNA Package we compare three distinct, previously published strategies to utilize SHAPE reactivities for structure prediction. The new tool is benchmarked on a set of RNAs with known reference structure.Availability and implementation: The capability for SHAPE directed RNA folding is part of the upcoming release of the ViennaRNA Package 2.2, for which a preliminary release is already freely available at http://www.tbi.univie.ac.at/RNA.Contact: michael.wolfinger@univie.ac.atSupplementary information: Supplementary data are available at Bioinformatics online.

SP-fold Speculative Parallelization for Parallel Algorithm of RNA Secondary Structure Prediction on Multicore

is faced with accelerating increase of data set sizes originating from powerful high-throughput measuring devices. Extensive computational power is the basic requirement for solving problems in bioinformatics. One of the key solutions to time-efficient data processing is the proper implementation of computational intensive tasks using parallel technology. A large number of cores is combined into a single chip to improve the overall performance of the multi- core processors. This depicts the current trends in processor architecture. This paper proposes a new software-only speculative parallelization scheme for implementing RNA Secondary Structure Prediction algorithm in parallel. The scheme is developed after a systematic evaluation of the design options available. It is also shown to be efficient, robust and to outperform previously proposed schemes used for parallel implementation of RNA Secondary Structure Prediction.

RNA Secondary Structure Prediction Algorithms Including Pseudoknots

Pseudoknot is an important motif in RNA secondary structure. Early researchers of RNA secondary structure prediction ignored pseudoknots, but now pseudoknot is in focus in RNA secondary structure prediction. Several algorithms like dynamic programming, comparative algorithms, heuristic algorithms, formal grammar algorithms etc have so far been used for pseudoknot prediction, but the prediction of arbitrary pseudoknots is still an open problem. Also, there does not exist standard categorization of pseudoknot types. This article provides a brief description and comparison of various algorithms being used in pseudoknot prediction along with an overview of various forms of pseudoknots and their representations. Keywords: Comparative algorithm, dynamic programming, formal grammar, heuristics, pseudoknot, RNA secondary structure.

A Parallel Intelligence Algorithm for RNA Secondary Structure Prediction

RNA secondary structure prediction algorithms tend to have higher time and space complexity. Some swarm intelligence algorithms can be applied to RNA secondary structure prediction on the basis of stem regions combinatorial optimization. This paper presents a parallel discrete shuffled frog leaping algorithm (parallel-DSFLA), which can run on a distributed cluster using the MPI programming mode. The experimental results show that the parallel-DSFLA got better speed-up ratio, can improve the RNA secondary structure prediction efficiency and save time.

PreRkTAG: Prediction of RNA Knotted Structures Using Tree Adjoining Grammars

Background: RNA molecules play many important regulatory, catalytic and structural roles in the cell, and RNA secondary structure prediction with pseudoknots is one the most important problems in biology. An RNA pseudoknot is an element of the RNA sec ondary structure in which bases of a single-stranded loop pair with complementary bases outside the loop. Modeling these nested structures (pseudoknots) causes numerous com putational diffilties and so it has been generally neglected in RNA structure prediction algorithms. Objectives: In this study, we present a new heuristic algorithm for the Prediction of RNA Knotted structures using Tree Adjoining Grammars (named PreRKTAG). Materials and Methods: For a given RNA sequence, PreRKTAG uses a genetic algorithm on tree adjoining grammars to propose a structure with minimum thermodynamic energy. The genetic algorithm employs a subclass of tree adjoining grammars as individuals by which the secondary structure of RNAs are modeled. Upon the tree adjoining grammars, new crossover and mutation operations were designed.The finess function is defied ac cording to the RNA thermodynamic energy function, which causes the algorithm conver gence to be a stable structure. Results: The applicability of our algorithm is demonstrated by comparing its iresults with three well-known RNA secondary structure prediction algorithms that support crossed structures. Conclusions: We performed our comparison on a set of RNA sequences from the RNAseP database, where the outcomes show effiency and practicality of the proposed algorithm.

Study of RNA Secondary Structure Prediction Algorithms

RNA secondary structure study is one of the most important fields in computational molecular biology. According to different conditions, RNA secondary structure prediction derives two ways. In the paper, the method to predict RNA secondary structure is introduced in two ways. It includes the mathematic models and main algorithms. The paper also points out the existing problems. The main development directions of RNA secondary structure prediction algorithm is also be indicated.

RNA secondary structure prediction algorithm based on steam-combination

RNA secondary structure prediction is the hot topic in bioinformatics.Especially,the RNA secondary structure prediction with pseudoknot has been proved a NP-hard problem.According to the characteristics of RNA folding,a heuristic algorithm — QuasiRP to predict RNA secondary structure was presented.Using stem as the unit,combining graph theory and fundamental theory of binary relations,QuasiRP can find the optimal stem-combination based on Minimal Free Energy (MFE) criterion.The time complexity is O(n3) while the space complexity is O(n2),and pseudoknot can be found.The results show the validity of the algorithm.

RNA secondary structure prediction algorithm based on fast dynamic weighted matching

On the basis of dynamic weighted matching algorithm, this paper introduced an RNA secondary structure prediction algorithm based on fast dynamic weighted matching. In order to reduce time complicated degree and to improve the ability of pseudoknot prediction, we employed fast searching of max dynamic weight stem algorithm and expanded searching area of pseudoknot respectively. As a result, compared with dynamic weighted matching algorithm, the fast dynamic weighted matching algorithm not only has better time complicated degree which is O(n3), but also can predict more possibly existing pseudoknots.

Visualization of RNA secondary structures using highly parallel computers.

Results of RNA secondary structure prediction algorithm are usually given as a set of hydrogen bonds between bases. However, we cannot know the precise structure of an RNA molecule by only knowing which bases form hydrogen bonds. One way to understand the structure of an RNA molecule is to visualize it using a planar graph so that we can easily know the geometric relations among the substructures such as stacking regions and loops. To do this, we consider bases to be particles on a plane and introduce a repulsive force and an attractive force among these particles and determine their positions according to these forces. A naive algorithm requires O(N2) time but we can reduce it to O(NlogN) with an approximation algorithm which is often used in the area of N-body simulation. Our program is written in parallel object-oriented language 'Schematic' which is recently developed. Efficiency of our implementation on a parallel computer and results of visualization of secondary structures are presented using cadang-cadang coconut viroid as an example.