scholarly journals BiORSEO: a bi-objective method to predict RNA secondary structures with pseudoknots using RNA 3D modules

2020 ◽  
Vol 36 (8) ◽  
pp. 2451-2457
Author(s):  
Louis Becquey ◽  
Eric Angel ◽  
Fariza Tahi
Keyword(s):  
Structure Prediction ◽  
Secondary Structure Prediction ◽  
State Of The Art ◽  
Secondary Structures ◽  
Supplementary Information ◽  
Large Set ◽  
Objective Method ◽  
Rna Secondary Structures ◽  
Knowledge Based ◽  
Module Size

Abstract Motivation RNA loops have been modelled and clustered from solved 3D structures into ordered collections of recurrent non-canonical interactions called ‘RNA modules’, available in databases. This work explores what information from such modules can be used to improve secondary structure prediction. We propose a bi-objective method for predicting RNA secondary structures by minimizing both an energy-based and a knowledge-based potential. The tool, called BiORSEO, outputs secondary structures corresponding to the optimal solutions from the Pareto set. Results We compare several approaches to predict secondary structures using inserted RNA modules information: two module data sources, Rna3Dmotif and the RNA 3D Motif Atlas, and different ways to score the module insertions: module size, module complexity or module probability according to models like JAR3D and BayesPairing. We benchmark them against a large set of known secondary structures, including some state-of-the-art tools, and comment on the usefulness of the half physics-based, half data-based approach. Availability and implementation The software is available for download on the EvryRNA website, as well as the datasets. Supplementary information Supplementary data are available at Bioinformatics online.

scholarly journals RNA secondary structure prediction using deep learning with thermodynamic integration

2020 ◽  
Author(s):  
Kengo Sato ◽  
Manato Akiyama ◽  
Yasubumi Sakakibara
Keyword(s):  
Deep Learning ◽  
Secondary Structure ◽  
Structure Prediction ◽  
Rna Secondary Structure ◽  
Secondary Structure Prediction ◽  
Secondary Structures ◽  
Thermodynamic Integration ◽  
Rna Secondary Structure Prediction ◽  
Rna Secondary Structures ◽  
Non Coding Rnas

RNA secondary structure prediction is one of the key technologies for revealing the essential roles of functional non-coding RNAs. Although machine learning-based rich-parametrized models have achieved extremely high performance in terms of prediction accuracy, the risk of overfitting for such models has been reported. In this work, we propose a new algorithm for predicting RNA secondary structures that uses deep learning with thermodynamic integration, thereby enabling robust predictions. Similar to our previous work, the folding scores, which are computed by a deep neural network, are integrated with traditional thermodynamic parameters to enable robust predictions. We also propose thermodynamic regularization for training our model without overfitting it to the training data. Our algorithm (MXfold2) achieved the most robust and accurate predictions in computational experiments designed for newly discovered non-coding RNAs, with significant 2–10 % improvements over our previous algorithm (MXfold) and standard algorithms for predicting RNA secondary structures in terms of F-value.

P-DCFOLD OR HOW TO PREDICT ALL KINDS OF PSEUDOKNOTS IN RNA SECONDARY STRUCTURES

2005 ◽  
Vol 14 (05) ◽  
pp. 703-716 ◽  
Author(s):  
FARIZA TAHI ◽  
ENGELEN STEFAN ◽  
MIREILLE REGNIER
Keyword(s):  
Structure Prediction ◽  
Secondary Structure Prediction ◽  
Secondary Structures ◽  
Divide And Conquer ◽  
Comparative Approach ◽  
Rna Sequences ◽  
Rna Secondary Structure Prediction ◽  
Rna Secondary Structures ◽  
Knowing That ◽  
Definition Of

Pseudoknots play important roles in many RNAs. But for computational reasons, pseudoknots are usually excluded from the definition of RNA secondary structures. Indeed, prediction of pseudoknots increase very highly the complexities in time of the algorithms, knowing that all existing algorithms for RNA secondary structure prediction have complexities at least of O(n3). Some algorithms have been developed for searching pseudoknots, but all of them have very high complexities, and consider generally particular kinds of pseudoknots. We present an algorithm, called P-DCFold based on the comparative approach, for the prediction of RNA secondary structures including all kinds of pseudoknots. The helices are searched recursively using the "Divide and Conquer" approach, searching the helices from the "most significant" to the "less significant". A selected helix subdivide the sequence into two sub-sequences, the internal one and a concatenation of the two externals. This approach is used to search non-interleaved helices and allows to limit the space of searching. To search for pseudoknots, the processing is reiterated. Therefore, each helix of the pseudoknot is selected in a different step. P-DCFold has been applied to several RNA sequences. In less than two seconds, their respective secondary structures, including their pseudoknots, have been recovered very efficiently.

A NON-PARAMETRIC BAYESIAN APPROACH FOR PREDICTING RNA SECONDARY STRUCTURES

2010 ◽  
Vol 08 (04) ◽  
pp. 727-742 ◽  
Author(s):  
KENGO SATO ◽  
MICHIAKI HAMADA ◽  
TOUTAI MITUYAMA ◽  
KIYOSHI ASAI ◽  
YASUBUMI SAKAKIBARA
Keyword(s):  
Secondary Structure ◽  
Bayesian Approach ◽  
Structure Prediction ◽  
Rna Secondary Structure ◽  
Secondary Structure Prediction ◽  
Secondary Structures ◽  
Generative Models ◽  
Rna Secondary Structures ◽  
Stochastic Context Free Grammars ◽  
Non Parametric

Since many functional RNAs form stable secondary structures which are related to their functions, RNA secondary structure prediction is a crucial problem in bioinformatics. We propose a novel model for generating RNA secondary structures based on a non-parametric Bayesian approach, called hierarchical Dirichlet processes for stochastic context-free grammars (HDP-SCFGs). Here non-parametric means that some meta-parameters, such as the number of non-terminal symbols and production rules, do not have to be fixed. Instead their distributions are inferred in order to be adapted (in the Bayesian sense) to the training sequences provided. The results of our RNA secondary structure predictions show that HDP-SCFGs are more accurate than the MFE-based and other generative models.

scholarly journals RNA secondary structure prediction using deep learning with thermodynamic integration

2021 ◽  
Vol 12 (1) ◽  
Author(s):  
Kengo Sato ◽  
Manato Akiyama ◽  
Yasubumi Sakakibara
Keyword(s):  
Free Energy ◽  
Deep Learning ◽  
Secondary Structure ◽  
Structure Prediction ◽  
Rna Secondary Structure ◽  
Nearest Neighbor ◽  
Secondary Structure Prediction ◽  
Secondary Structures ◽  
Rna Secondary Structures ◽  
Non Coding Rnas

AbstractAccurate predictions of RNA secondary structures can help uncover the roles of functional non-coding RNAs. Although machine learning-based models have achieved high performance in terms of prediction accuracy, overfitting is a common risk for such highly parameterized models. Here we show that overfitting can be minimized when RNA folding scores learnt using a deep neural network are integrated together with Turner’s nearest-neighbor free energy parameters. Training the model with thermodynamic regularization ensures that folding scores and the calculated free energy are as close as possible. In computational experiments designed for newly discovered non-coding RNAs, our algorithm (MXfold2) achieves the most robust and accurate predictions of RNA secondary structures without sacrificing computational efficiency compared to several other algorithms. The results suggest that integrating thermodynamic information could help improve the robustness of deep learning-based predictions of RNA secondary structure.

scholarly journals Direct inference of base-pairing probabilities with neural networks improves RNA secondary structure prediction with pseudoknots

2018 ◽  
Author(s):  
Manato Akiyama ◽  
Yasubumi Sakakibara ◽  
Kengo Sato
Keyword(s):  
Neural Networks ◽  
Secondary Structure ◽  
Structure Prediction ◽  
Secondary Structure Prediction ◽  
Secondary Structures ◽  
Support Vector ◽  
Base Pairing ◽  
Rna Secondary Structures ◽  
Decoding Algorithms ◽  
The Neural Networks

AbstractMotivationExisting approaches for predicting RNA secondary structures depend on howto decompose a secondary structure into substructures, so-called the architecture, to define their parameter space. However, the architecture has not been sufficiently investigated especially for pseudoknotted secondary structures.ResultsIn this paper, we propose a novel algorithm to directly infer base-pairing probabilities with neural networks that does not depend on the architecture of RNA secondary structures, followed by performing the maximum expected accuracy (MEA) based decoding algorithms; Nussinov-style decoding for pseudoknot-free structures, and IPknot-style decoding for pseudoknotted structures. To train the neural networks connected to each base-pair, we adopt a max-margin framework, called structured support vector machines (SSVM), as the output layer. Our benchmarks for predicting RNA secondary structures with and without pseudoknots show that our algorithm achieves the best prediction accuracy compared with existing methods.AvailabilityThe source code is available at https://github.com/keio-bioinformatics/neuralfold/[email protected]

scholarly journals Caveats to deep learning approaches to RNA secondary structure prediction

2021 ◽  
Author(s):  
Christoph Flamm ◽  
Julia Wielach ◽  
Michael T. Wolfinger ◽  
Stefan Badelt ◽  
Ronny Lorenz ◽  
...  
Keyword(s):  
Machine Learning ◽  
Deep Learning ◽  
Secondary Structure ◽  
Structure Prediction ◽  
Secondary Structure Prediction ◽  
Secondary Structures ◽  
Training Data ◽  
Sequence Length ◽  
Learning Approaches ◽  
Rna Secondary Structures

Machine learning (ML) and in particular deep learning techniques have gained popularity for predicting structures from biopolymer sequences. An interesting case is the prediction of RNA secondary structures, where well established biophysics based methods exist. These methods even yield exact solutions under certain simplifying assumptions. Nevertheless, the accuracy of these classical methods is limited and has seen little improvement over the last decade. This makes it an attractive target for machine learning and consequently several deep learning models have been proposed in recent years. In this contribution we discuss limitations of current approaches, in particular due to biases in the training data. Furthermore, we propose to study capabilities and limitations of ML models by first applying them on synthetic data that can not only be generated in arbitrary amounts, but are also guaranteed to be free of biases. We apply this idea by testing several ML models of varying complexity. Finally, we show that the best models are capable of capturing many, but not all, properties of RNA secondary structures. Most severely, the number of predicted base pairs scales quadratically with sequence length, even though a secondary structure can only accommodate a linear number of pairs.

scholarly journals Comparative Sequence Analysis and Patterns of Covariation in RNA Secondary Structures

Genetics ◽  
2000 ◽  
Vol 154 (2) ◽  
pp. 909-921 ◽  
Author(s):  
John Parsch ◽  
John M Braverman ◽  
Wolfgang Stephan
Keyword(s):  
Structure Prediction ◽  
Secondary Structure Prediction ◽  
Rnase P ◽  
Secondary Structures ◽  
Comparative Sequence Analysis ◽  
Small Subunit ◽  
Physical Parameters ◽  
Small Subunit Rrna ◽  
Base Pairing ◽  
Compensatory Evolution

Abstract A novel method of RNA secondary structure prediction based on a comparison of nucleotide sequences is described. This method correctly predicts nearly all evolutionarily conserved secondary structures of five different RNAs: tRNA, 5S rRNA, bacterial ribonuclease P (RNase P) RNA, eukaryotic small subunit rRNA, and the 3′ untranslated region (UTR) of the Drosophila bicoid (bcd) mRNA. Furthermore, covariations occurring in the helices of these conserved RNA structures are analyzed. Two physical parameters are found to be important determinants of the evolution of compensatory mutations: the length of a helix and the distance between base-pairing nucleotides. For the helices of bcd 3′ UTR mRNA and RNase P RNA, a positive correlation between the rate of compensatory evolution and helix length is found. The analysis of Drosophila bcd 3′ UTR mRNA further revealed that the rate of compensatory evolution decreases with the physical distance between base-pairing residues. This result is in qualitative agreement with Kimura's model of compensatory fitness interactions, which assumes that mutations occurring in RNA helices are individually deleterious but become neutral in appropriate combinations.

KORP: knowledge-based 6D potential for fast protein and loop modeling

2019 ◽  
Vol 35 (17) ◽  
pp. 3013-3019 ◽  
Author(s):  
José Ramón López-Blanco ◽  
Pablo Chacón
Keyword(s):  
Structure Prediction ◽  
Protein Structures ◽  
Joint Probability ◽  
Protein Modeling ◽  
Supplementary Information ◽  
Joint Probability Distribution ◽  
Loop Modeling ◽  
Statistical Potentials ◽  
Knowledge Based ◽  
Backbone Atoms

Abstract Motivation Knowledge-based statistical potentials constitute a simpler and easier alternative to physics-based potentials in many applications, including folding, docking and protein modeling. Here, to improve the effectiveness of the current approximations, we attempt to capture the six-dimensional nature of residue–residue interactions from known protein structures using a simple backbone-based representation. Results We have developed KORP, a knowledge-based pairwise potential for proteins that depends on the relative position and orientation between residues. Using a minimalist representation of only three backbone atoms per residue, KORP utilizes a six-dimensional joint probability distribution to outperform state-of-the-art statistical potentials for native structure recognition and best model selection in recent critical assessment of protein structure prediction and loop-modeling benchmarks. Compared with the existing methods, our side-chain independent potential has a lower complexity and better efficiency. The superior accuracy and robustness of KORP represent a promising advance for protein modeling and refinement applications that require a fast but highly discriminative energy function. Availability and implementation http://chaconlab.org/modeling/korp. Supplementary information Supplementary data are available at Bioinformatics online.

scholarly journals OPUS-TASS: a protein backbone torsion angles and secondary structure predictor based on ensemble neural networks

2020 ◽  
Vol 36 (20) ◽  
pp. 5021-5026 ◽  
Author(s):  
Gang Xu ◽  
Qinghua Wang ◽  
Jianpeng Ma
Keyword(s):  
Neural Networks ◽  
Secondary Structure ◽  
Structure Prediction ◽  
Secondary Structure Prediction ◽  
Supplementary Information ◽  
Learning Approaches ◽  
Protein Backbone ◽  
Torsion Angles ◽  
Secondary Structure Predictions ◽  
The Mean

Abstract Motivation Predictions of protein backbone torsion angles (ϕ and ψ) and secondary structure from sequence are crucial subproblems in protein structure prediction. With the development of deep learning approaches, their accuracies have been significantly improved. To capture the long-range interactions, most studies integrate bidirectional recurrent neural networks into their models. In this study, we introduce and modify a recently proposed architecture named Transformer to capture the interactions between the two residues theoretically with arbitrary distance. Moreover, we take advantage of multitask learning to improve the generalization of neural network by introducing related tasks into the training process. Similar to many previous studies, OPUS-TASS uses an ensemble of models and achieves better results. Results OPUS-TASS uses the same training and validation sets as SPOT-1D. We compare the performance of OPUS-TASS and SPOT-1D on TEST2016 (1213 proteins) and TEST2018 (250 proteins) proposed in the SPOT-1D paper, CASP12 (55 proteins), CASP13 (32 proteins) and CASP-FM (56 proteins) proposed in the SAINT paper, and a recently released PDB structure collection from CAMEO (93 proteins) named as CAMEO93. On these six test sets, OPUS-TASS achieves consistent improvements in both backbone torsion angles prediction and secondary structure prediction. On CAMEO93, SPOT-1D achieves the mean absolute errors of 16.89 and 23.02 for ϕ and ψ predictions, respectively, and the accuracies for 3- and 8-state secondary structure predictions are 87.72 and 77.15%, respectively. In comparison, OPUS-TASS achieves 16.56 and 22.56 for ϕ and ψ predictions, and 89.06 and 78.87% for 3- and 8-state secondary structure predictions, respectively. In particular, after using our torsion angles refinement method OPUS-Refine as the post-processing procedure for OPUS-TASS, the mean absolute errors for final ϕ and ψ predictions are further decreased to 16.28 and 21.98, respectively. Availability and implementation The training and the inference codes of OPUS-TASS and its data are available at https://github.com/thuxugang/opus_tass. Supplementary information Supplementary data are available at Bioinformatics online.

QuanTest2: benchmarking multiple sequence alignments using secondary structure prediction

2019 ◽  
Author(s):  
Fabian Sievers ◽  
Desmond G Higgins
Keyword(s):  
Secondary Structure ◽  
Structure Prediction ◽  
Secondary Structure Prediction ◽  
Reference Sequence ◽  
Supplementary Information ◽  
Sequence Alignments ◽  
Multiple Sequence ◽  
Multiple Sequence Alignments ◽  
Reference Sequences ◽  
Selection Of

Abstract Motivation Secondary structure prediction accuracy (SSPA) in the QuanTest benchmark can be used to measure accuracy of a multiple sequence alignment. SSPA correlates well with the sum-of-pairs score, if the results are averaged over many alignments but not on an alignment-by-alignment basis. This is due to a sub-optimal selection of reference and non-reference sequences in QuanTest. Results We develop an improved strategy for selecting reference and non-reference sequences for a new benchmark, QuanTest2. In QuanTest2, SSPA and SP correlate better on an alignment-by-alignment basis than in QuanTest. Guide-trees for QuanTest2 are more balanced with respect to reference sequences than in QuanTest. QuanTest2 scores correlate well with other well-established benchmarks. Availability and implementation QuanTest2 is available at http://bioinf.ucd.ie/quantest2.tar, comprises of reference and non-reference sequence sets and a scoring script. Supplementary information Supplementary data are available at Bioinformatics online

Sign in / Sign up

Export Citation Format

Share Document