bioRxiv Science⌕ Search

Biology subjects

Aviran, S.

Publications and source records attributed to Aviran, S..

7 recordsLinked to original sources

Markov models of SHAPE data improve secondary structure prediction

RNA structure is a key determinant of RNA function and regulation. The coupling of chemical probing technologies, such as SHAPE, with deep sequencing has enabled large-scale experimental characterization of RNA structures in complex samples and under diverse conditions. Furthermore, probing data are often used to guide thermodynamics-based secondary structure prediction algorithms and have been shown to improve their accuracy. However, current algorithms treat these single-nucleotide measurements as statistically independent signals, inherently overlooking short-range dependencies in the data. Here, we show that discretized SHAPE data display context dependence within loop regions and within stem regions and we use Markov models to formally capture such dependencies. We then leverage Markov modeling in the classification of small structure motifs from their discretized SHAPE data signatures and subsequently integrate the classifying feature into the dynamic programming recursions that underlie computational RNA folding. Compared to state-of-the-art SHAPE-guided structure prediction methods, our Markov-informed framework improves prediction performance. Furthermore, we identify SHAPE signatures characteristic of highly stable hairpins, such as GAAA, GCAA, and UUCG tetraloops, and integrate these insights into the folding recursions to further improve predictions. Overall, the proposed framework provides a foundation for context-aware statistical modeling of SHAPE data, particularly in loop regions, where signal characterization has proven challenging due to high variance. This work further demonstrates that finer modeling of SHAPE data has the potential to push the limits of data-guided secondary structure prediction.

bioinformatics↗

Nearest Neighbor Parameters for Estimating the Folding Stability of RNA Including Pseudouridine

Nearest neighbor parameters are widely used in software for estimating the conformational stability of an RNA sequence folding into a specific structure. Folding stability for RNA with canonical nucleotides A, C, G, and U has been widely studied, but the same is not true for most modified nucleotides. In this work, we present a comprehensive set of nearest neighbor parameters for estimating the folding stability of RNA including pseudouridine in helical or loop contexts. These parameters are derived from 210 optical melting experiments involving helices with pseudouridine-A and pseudouridine-G pairs and with pseudouridine in loop motifs. The experiments include sequences with pseudouridine and U in the same strand, including U-A and U-G pairs, allowing us to consider the folding stability of sequences with both U and pseudouridine. On average, pseudouridine stabilizes RNA folding compared to U in an analogous motif, although this effect is sequence-context dependent. These parameters improve the modeling of folding stability for RNA secondary structures containing pseudouridine. We demonstrate that these parameters successfully model the secondary structure change for Saccharomyces cerevisiae U2 snRNA when two additional inducible pseudouridines are present. These parameters are freely available and incorporated into the RNAstructure software package. O_FIG O_LINKSMALLFIG WIDTH=200 HEIGHT=81 SRC="FIGDIR/small/725682v1_ufig1.gif" ALT="Figure 1"> View larger version (14K): org.highwire.dtl.DTLVardef@e1167aorg.highwire.dtl.DTLVardef@18ac7f0org.highwire.dtl.DTLVardef@4c909eorg.highwire.dtl.DTLVardef@aa8bca_HPS_FORMAT_FIGEXP M_FIG C_FIG

biochemistry↗

RNA Folding Nearest Neighbor Parameters Including the Modification 1-Methyl-Pseudouridine

Nearest neighbor analysis is commonly used to estimate RNA folding stabilities. In this contribution, we report a set of RNA folding nearest neighbor parameters for estimating free energy change for RNA sequences including 1-methyl-pseudouridine. Development of mRNA vaccines has identified 1-methyl-pseudouridine as a key nucleobase modification for suppressing innate immune responses. However, the contributions of these modifications to RNA folding stability were unclear. Our new parameters provide helical terms for 1-methyl-pseudouridine-adenine and 1-methyl-pseudouridine-guanine base pairs. The parameters also estimate loop stabilities for loops with 1-methyl-pseudouridine or a combination of 1-methyl-pseudouridine and uridine. These parameters are derived using 208 optical melting experiments and tested against an additional 16 optical melting experiments. On average, we find that substitution of uridine with 1-methyl-pseudouridine stabilizes RNA folding, with the extent of stabilization depending on adjacent sequence. The estimation of tRNA folding ensembles for tRNA sequences with 1-methyl-pseudouridine was significantly improved using the new nearest neighbor parameters. The new nearest neighbor parameters are provided as part of the RNAstructure software package. With these parameters, the secondary structures of natural sequences with 1-methyl-pseudouridine and mRNA therapeutics fully substituted with 1-methyl-pseudouridine can be modeled.

bioinformatics↗

Deep Learning for RNA Secondary Structure Determination: Gauging Generalizability and Broadening the Scope of Traditional Methods

The diverse regulatory functions, protein production capacity, and stability of natural and synthetic RNAs are closely tied to their ability to fold into intricate structures. Determining RNA structure is thus fundamental to RNA biology and bioengineering. Among existing approaches to structure determination, computational secondary structure prediction offers a rapid and low-cost strategy and is thus widely used, especially when seeking to identify functional RNA elements in large transcriptomes or screen massive libraries of novel designs. While traditional approaches rely on detailed measurements of folding energetics and/or probabilistic modeling of structural data, recent years have witnessed a surge in deep learning methods, inspired by their tremendous success in protein structure prediction. However, the limited diversity and volume of known RNA structures can impede their ability to accurately predict structures markedly different from the ones they have seen. This is known as the generalization gap and currently poses a major barrier to progress in the field. In this Perspective article, we gauge method generalizability using a new benchmark dataset of structured RNAs we curated from the Protein Data Bank. We also discuss the emergence of deep learning methods for predicting structure probing data and use a new dataset to underscore generalization challenges unique to this domain along with directions for future improvement. Expanding beyond improving predictive accuracy, we review how advances in deep learning have recently enabled scalable and accessible optimization of traditional structure prediction methods and their seamless integration with modern neural networks.

bioinformatics↗

Accurate detection of RNA stem-loops in structurome data reveals widespread association with protein binding sites

RNA molecules are known to fold into specific structures which often play a central role in their functions and regulation. In silico folding of RNA transcripts, especially when assisted with structure profiling (SP) data, is capable of accurately elucidating relevant structural conformations. However, such methods scale poorly to the swaths of SP data generated by transcriptome-wide experiments, which are becoming more commonplace and advancing our understanding of RNA structure and its regulation at global and local levels. This has created a need for tools capable of rapidly deriving structural assessments from SP data in a scalable manner. One such tool we previously introduced that aims to process such data is patteRNA, a statistical learning algorithm capable of rapidly mining big SP datasets for structural elements. Here, we present a reformulation of patteRNAs pattern recognition scheme that sees significantly improved precision without major compromises to computational overhead. Specifically, we developed a data-driven logistic classifier which interprets patteRNAs statistical characterizations of SP data in addition to local sequence properties as measured with a nearest neighbor thermodynamic model. Application of the classifier to human structurome data reveals a marked association between detected stem-loops and RNA binding protein (RBP) footprints. The results of our application demonstrate that upwards of 30% of RBP footprints occur within loops of stable stem-loop elements. Overall, our work arrives at a rapid and accurate method for automatically detecting families of RNA structure motifs and demonstrates the functional relevance of identifying them transcriptome-wide.

genomics↗

Rapid structure-function insights via hairpin-centric analysis of big RNA structure probing datasets

The functions of RNA are often tied to its structure, hence analyzing structure is of significant interest when studying cellular processes. Recently, large-scale structure probing (SP) studies have enabled assessment of global structure-function relationships via standard data summarizations or local folding. Here, we approach structure quantification from a hairpin-centric perspective where putative hairpins are identified in SP datasets and used as a means to capture local structural effects. This has the advantage of rapid processing of big (e.g., transcriptome-wide) data as RNA folding is circumvented, yet it captures more information than simple data summarizations. We reformulate a statistical learning algorithm we previously developed to significantly improve precision of hairpin detection, then introduce a novel nucleotide-wise measure, termed the hairpin-derived structure level (HDSL), which captures local structuredness by accounting for the presence of likely hairpin elements. Applying HDSL to data from recent studies recapitulates, strengthens, and expands on their findings which were obtained by more comprehensive folding algorithms, yet our analyses are orders of magnitude faster. These results demonstrate that hairpin detection is a promising avenue for global and rapid structure-function analysis, furthering our understanding of RNA biology and the principal features which drive biological insights from SP data.

genomics↗

Extracting information from RNA SHAPE data: Kalman filtering approach

RNA SHAPE experiments have become important and successful sources of information for RNA structure prediction. In such experiments, chemical reagents are used to probe RNA backbone flexibility at the nucleotide level, which in turn provides information on base pairing and therefore secondary structure. Little is known, however, about the statistics of such SHAPE data. In this work, we explore different representations of noise in SHAPE data and propose a statistically sound framework for extracting reliable reactivity information from multiple SHAPE replicates. Our analyses of RNA SHAPE experiments underscore that a normal noise model is not adequate to represent their data. We propose instead a log-normal representation of noise and discuss its relevance. Under this assumption, we observe that processing simulated SHAPE data by directly averaging different replicates leads to bias. Such bias can be reduced by analyzing the data following a log transformation, either by log-averaging or Kalman filtering. Application of Kalman filtering has the additional advantage that a prior on the nucleotide reactivities can be introduced. We show that the performance of Kalman filtering is then directly dependent on the quality of that prior. We conclude the paper with guidelines on signal processing of RNA SHAPE data.

bioinformatics↗