RNA Secondary Structure Information Research Articles

E-RNA: a collection of web-servers for the prediction and visualisation of RNA secondary structure and their functional features.

e-RNA is a collection of web-servers for the prediction and visualisation of RNA secondary structures and their functional features, including in particular RNA-RNA interactions. In this updated version, we have added novel tools for RNA secondary structure prediction and have significantly updated the visualisation functionality. The new method CoBold can identify transient RNA structure features and their potential functional effects on a known RNA structure during co-transcriptional structure formation. New tool ShapeSorter can predict evolutionarily conserved RNA secondary structure features while simultaneously taking experimental SHAPE probing evidence into account. The web-server R-Chie which visualises RNA secondary structure information in terms of arc diagrams, can now be used to also visualise and intuitively compare RNA-RNA, RNA-DNA and DNA-DNA interactions alongside multiple sequence alignments and quantitative information. The prediction generated by any method in e-RNA can be readily visualised on the web-server. For completed tasks, users can download their results and readily visualise them later on with R-Chie without having to re-run the predictions. e-RNA can be found at http://www.e-rna.org.

18S and ITS2 rDNA sequence-structure phylogeny of Prototheca (Chlorophyta, Trebouxiophyceae)

Protothecosis is an infectious disease caused by organisms currently classified within the green algal genus Prototheca. The disease can manifest as cutaneous lesions, olecranon bursitis or disseminated or systemic infections in both immunocompetent and immunosuppressed patients. Concerning diagnostics, taxonomic validity is important. Prototheca, closely related to the Chlorella species complex, is known to be polyphyletic, branching with Auxenochlorella and Helicosporidium. The phylogeny of Prototheca was discussed and revisited several times in the last decade; new species have been described. Phylogenetic analyses were performed using ribosomal DNA (rDNA) and partial mitochondrial cytochrome b (cytb) sequence data. In this work we use Internal Transcribed Spacer 2 (ITS2) as well as 18S rDNA data. However, for the first time, we reconstruct phylogenetic relationships of Prototheca using primary sequence and RNA secondary structure information simultaneously, a concept shown to increase robustness and accuracy of phylogenetic tree estimation. Using encoded sequence-structure data, Neighbor-Joining, Maximum-Parsimony and Maximum-Likelihood methods yielded well-supported trees in agreement with other trees calculated on rDNA; but differ in several aspects from trees using cytb as a phylogenetic marker. ITS2 secondary structures of Prototheca sequences are in agreement with the well-known common core structure of eukaryotes but show unusual differences in their helix lengths. An elongation of the fourth helix of some species seems to have occurred independently in the course of evolution.

G4detector: Convolutional Neural Network to Predict DNA G-Quadruplexes.

G-quadruplexes (G4s) are nucleic acid secondary structures that form within guanine-rich DNA or RNA sequences. G4 formation can affect chromatin architecture and gene regulation, and has been associated with genomic instability, genetic diseases, and cancer progression. The experimental data produced by the G4-seq experiment provides unprecedented details on G4 formation in the genome. Still, running the experimental protocol on a whole genome is an expensive and time-consuming process. Thus, it is highly desirable to have a computational method to predict G4 formation in new DNA sequences or whole genomes. Here, we present G4detector, a new method based on a convolutional neural network to predict G4s from DNA sequences. On top of the sequence information, we improved prediction accuracy by the addition of RNA secondary structure information. To train and test G4detector, we compiled novel high-throughput benchmarks over multiple species genomes measured by the G4-seq protocol. We show that G4detector outperforms extant methods for the same task on all benchmark datasets, can detect G4s genome-wide with high accuracy, and is able to extrapolate human-trained measurements to various non-human species. The code and benchmarks are publicly available on github.com/OrensteinLab/G4detector.

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.

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.

GLASSgo - Automated and Reliable Detection of sRNA Homologs From a Single Input Sequence.

Bacterial small RNAs (sRNAs) are important post-transcriptional regulators of gene expression. The functional and evolutionary characterization of sRNAs requires the identification of homologs, which is frequently challenging due to their heterogeneity, short length and partly, little sequence conservation. We developed the GLobal Automatic Small RNA Search go (GLASSgo) algorithm to identify sRNA homologs in complex genomic databases starting from a single sequence. GLASSgo combines an iterative BLAST strategy with pairwise identity filtering and a graph-based clustering method that utilizes RNA secondary structure information. We tested the specificity, sensitivity and runtime of GLASSgo, BLAST and the combination RNAlien/cmsearch in a typical use case scenario on 40 bacterial sRNA families. The sensitivity of the tested methods was similar, while the specificity of GLASSgo and RNAlien/cmsearch was significantly higher than that of BLAST. GLASSgo was on average ∼87 times faster than RNAlien/cmsearch, and only ∼7.5 times slower than BLAST, which shows that GLASSgo optimizes the trade-off between speed and accuracy in the task of finding sRNA homologs. GLASSgo is fully automated, whereas BLAST often recovers only parts of homologs and RNAlien/cmsearch requires extensive additional bioinformatic work to get a comprehensive set of homologs. GLASSgo is available as an easy-to-use web server to find homologous sRNAs in large databases.

Topological Structure Determination of RNA Using Small-Angle X-Ray Scattering

Knowledge of RNA three-dimensional topological structures provides important insight into the relationship between RNA structural components and function. It is often likely that near-complete sets of biochemical and biophysical data containing structural restraints are not available, but one still wants to obtain knowledge about approximate topological folding of RNA. In this regard, general methods for determining such topological structures with minimum readily available restraints are lacking. Naked RNAs are difficult to crystallize and NMR spectroscopy is generally limited to small RNA fragments. By nature, sequence determines structure and all interactions that drive folding are self-contained within sequence. Nevertheless, there is little apparent correlation between primary sequences and three-dimensional folding unless supplemented with experimental or phylogenetic data. Thus, there is an acute need for a robust high-throughput method that can rapidly determine topological structures of RNAs guided by some experimental data. We present here a novel method (RS3D) that can assimilate the RNA secondary structure information, small-angle X-ray scattering data, and any readily available tertiary contact information to determine the topological fold of RNA. Conformations are firstly sampled at glob level where each glob represents a nucleotide. Best-ranked glob models can be further refined against solvent accessibility data, if available, and then converted to explicit all-atom coordinates for refinement against SAXS data using the Xplor-NIH program. RS3D is widely applicable to a variety of RNA folding architectures currently present in the structure database. Furthermore, we demonstrate applicability and feasibility of the program to derive low-resolution topological structures of relatively large multi-domain RNAs.

Topological structure determination of RNA using small-angle X-ray scattering

Knowledge of RNA three-dimensional topological structures provides important insight into the relationship between RNA structural components and function. It is often likely that near-complete sets of biochemical and biophysical data containing structural restraints are not available, but one still wants to obtain knowledge about approximate topological folding of RNA. In this regard, general methods for determining such topological structures with minimum readily available restraints are lacking. Naked RNAs are difficult to crystallize and NMR spectroscopy is generally limited to small RNA fragments. By nature, sequence determines structure and all interactions that drive folding are self-contained within sequence. Nevertheless, there is little apparent correlation between primary sequences and three-dimensional folding unless supplemented with experimental or phylogenetic data. Thus, there is an acute need for a robust high-throughput method that can rapidly determine topological structures of RNAs guided by some experimental data. We present here a novel method (RS3D) that can assimilate the RNA secondary structure information, small-angle X-ray scattering data, and any readily available tertiary contact information to determine the topological fold of RNA. Conformations are firstly sampled at glob level where each glob represents a nucleotide. Best-ranked glob models can be further refined against solvent accessibility data, if available, and then converted to explicit all-atom coordinates for refinement against SAXS data using the Xplor-NIH program. RS3D is widely applicable to a variety of RNA folding architectures currently present in the structure database. Furthermore, we demonstrate applicability and feasibility of the program to derive low-resolution topological structures of relatively large multi-domain RNAs.

A comprehensive database of high-throughput sequencing-based RNA secondary structure probing data (Structure Surfer)

BackgroundRNA molecules fold into complex three-dimensional shapes, guided by the pattern of hydrogen bonding between nucleotides. This pattern of base pairing, known as RNA secondary structure, is critical to their cellular function. Recently several diverse methods have been developed to assay RNA secondary structure on a transcriptome-wide scale using high-throughput sequencing. Each approach has its own strengths and caveats, however there is no widely available tool for visualizing and comparing the results from these varied methods.MethodsTo address this, we have developed Structure Surfer, a database and visualization tool for inspecting RNA secondary structure in six transcriptome-wide data sets from human and mouse (http://tesla.pcbi.upenn.edu/strucuturesurfer/). The data sets were generated using four different high-throughput sequencing based methods. Each one was analyzed with a scoring pipeline specific to its experimental design. Users of Structure Surfer have the ability to query individual loci as well as detect trends across multiple sites.ResultsHere, we describe the included data sets and their differences. We illustrate the database’s function by examining known structural elements and we explore example use cases in which combined data is used to detect structural trends.ConclusionsIn total, Structure Surfer provides an easy-to-use database and visualization interface for allowing users to interrogate the currently available transcriptome-wide RNA secondary structure information for mammals.Electronic supplementary materialThe online version of this article (doi:10.1186/s12859-016-1071-0) contains supplementary material, which is available to authorized users.

Importance of RNA secondary structure information for yeast donor and acceptor splice site predictions by neural networks

Previously, Patterson et al. showed that mRNA structure information aids splice site prediction in human genes [Patterson, D.J., Yasuhara, K., Ruzzo, W.L., 2002. Pre-mRNA secondary structure prediction aids splice site prediction. Pac. Symp. Biocomput. 7, 223–234]. Here, we have attempted to predict splice sites in selected genes of Saccharomyces cerevisiae using the information obtained from the secondary structures of corresponding mRNAs. From Ares database, 154 genes were selected and their structures were predicted by Mfold. We selected a 20-nucleotide window around each site, each containing 4 nucleotides in the exon region. Based on whether the nucleotide is in a stem or not, the conventional four-letter nucleotide alphabet was translated into an eight-letter alphabet. Two different three-layer-based perceptron neural networks were devised to predict the 5′ and 3′ splice sites. In case of 5′ site determination, a network with 3 neurons at the hidden layer was chosen, while in case of 3′ site 20 neurons acted more efficiently. Both neural nets were trained applying Levenberg–Marquardt backpropagation method, using half of the available genes as training inputs and the other half for testing and cross-validations. Sequences with GUs and AGs non-sites were used as negative controls. The correlation coefficients in the predictions of 5′ and 3′ splice sites using eight-letter alphabet were 98.0% and 69.6%, respectively, while these values were 89.3% and 57.1% when four-letter alphabet is applied. Our results suggest that considering the secondary structure of mRNA molecules positively affects both donor and acceptor site predictions by increasing the capacity of neural networks in learning the patterns.

Sequence-based heuristics for faster annotation of non-coding RNA families

Non-coding RNAs (ncRNAs) are functional RNA molecules that do not code for proteins. Covariance Models (CMs) are a useful statistical tool to find new members of an ncRNA gene family in a large genome database, using both sequence and, importantly, RNA secondary structure information. Unfortunately, CM searches are extremely slow. Previously, we created rigorous filters, which provably sacrifice none of a CM's accuracy, while making searches significantly faster for virtually all ncRNA families. However, these rigorous filters make searches slower than heuristics could be. In this paper we introduce profile HMM-based heuristic filters. We show that their accuracy is usually superior to heuristics based on BLAST. Moreover, we compared our heuristics with those used in tRNAscan-SE, whose heuristics incorporate a significant amount of work specific to tRNAs, where our heuristics are generic to any ncRNA. Performance was roughly comparable, so we expect that our heuristics provide a high-quality solution that--unlike family-specific solutions--can scale to hundreds of ncRNA families. The source code is available under GNU Public License at the supplementary web site.

Exploiting conserved structure for faster annotation of non-coding RNAs without loss of accuracy.

Non-coding RNAs (ncRNAs)-functional RNA molecules not coding for proteins-are grouped into hundreds of families of homologs. To find new members of an ncRNA gene family in a large genome database, covariance models (CMs) are a useful statistical tool, as they use both sequence and RNA secondary structure information. Unfortunately, CM searches are slow. Previously, we introduced 'rigorous filters', which provably sacrifice none of CMs' accuracy, although often scanning much faster. A rigorous filter, using a profile hidden Markov model (HMM), is built based on the CM, and filters the genome database, eliminating sequences that provably could not be annotated as homologs. The CM is run only on the remainder. Some biologically important ncRNA families could not be scanned efficiently with this technique, largely due to the significance of conserved secondary structure relative to primary sequence in identifying these families. Current heuristic filters are also expected to perform poorly on such families. By augmenting profile HMMs with limited secondary structure information, we obtain rigorous filters that accelerate CM searches for virtually all known ncRNA families from the Rfam Database and tRNA models in tRNAscan-SE. These filters scan an 8 gigabase database in weeks instead of years, and uncover homologs missed by heuristic techniques to speed CM searches. Software in development; contact the authors.