Statistical Mechanical Prediction of Ligand Perturbation to RNA Secondary Structure and Application to the SAM-I Riboswitch

2018 ◽  
Author(s):  
Osama Alaidi ◽  
Fareed Aboul-ela
Keyword(s):  
Secondary Structure ◽  
Ligand Binding ◽  
Rna Structure ◽  
Structure Prediction ◽  
Rna Secondary Structure ◽  
Rna Folding ◽  
Tertiary Structure ◽  
Secondary Structure Prediction ◽  
Key Factor ◽  
Statistical Mechanical

ABSTRACTThe realization that non protein-coding RNA (ncRNA) is implicated in an increasing number of cellular processes, many related to human disease, makes it imperative to understand and predict RNA folding. RNA secondary structure prediction is more tractable than tertiary structure or protein structure. Yet insights into RNA structure-function relationships are complicated by coupling between RNA folding and ligand binding. Here, we introduce a simple statistical mechanical formalism to calculate perturbations to equilibrium secondary structure conformational distributions for RNA, in the presence of bound cognate ligands. For the first time, this formalism incorporates a key factor in coupling ligand binding to RNA conformation: the differential affinity of the ligand for a range of RNA-folding intermediates. We apply the approach to the SAM-I riboswitch, for which binding data is available for analogs of intermediate secondary structure conformers. Calculations of equilibrium secondary structure distributions during the transcriptional “decision window” predict subtle shifts due to the ligand, rather than an on/off switch. The results suggest how ligand perturbation can release a kinetic block to the formation of a terminator hairpin in the full-length riboswitch. Such predictions identify aspects of folding that are most affected by ligand binding, and can readily be compared with experiment.

scholarly journals Quantitative high-throughput tests of ubiquitous RNA secondary structure prediction algorithms via RNA/protein binding

2019 ◽  
Author(s):  
Winston R. Becker ◽  
Inga Jarmoskaite ◽  
Kalli Kappel ◽  
Pavanapuresan P. Vaidyanathan ◽  
Sarah K. Denny ◽  
...  
Keyword(s):  
Secondary Structure ◽  
Protein Binding ◽  
Rna Structure ◽  
Structure Prediction ◽  
Rna Secondary Structure ◽  
Nearest Neighbor ◽  
Secondary Structure Prediction ◽  
Structural Features ◽  
Vast Number ◽  
Prediction Algorithms

AbstractNearest-neighbor (NN) rules provide a simple and powerful quantitative framework for RNA structure prediction that is strongly supported for canonical Watson-Crick duplexes from a plethora of thermodynamic measurements. Predictions of RNA secondary structure based on nearest-neighbor (NN) rules are routinely used to understand biological function and to engineer and control new functions in biotechnology. However, NN applications to RNA structural features such as internal and terminal loops rely on approximations and assumptions, with sparse experimental coverage of the vast number of possible sequence and structural features. To test to what extent NN rules accurately predict thermodynamic stabilities across RNAs with non-WC features, we tested their predictions using a quantitative high-throughput assay platform, RNA-MaP. Using a thermodynamic assay with coupled protein binding, we carried out equilibrium measurements for over 1000 RNAs with a range of predicted secondary structure stabilities. Our results revealed substantial scatter and systematic deviations between NN predictions and observed stabilities. Solution salt effects and incorrect or omitted loop parameters contribute to these observed deviations. Our results demonstrate the need to independently and quantitatively test NN computational algorithms to identify their capabilities and limitations. RNA-MaP and related approaches can be used to test computational predictions and can be adapted to obtain experimental data to improve RNA secondary structure and other prediction algorithms.Significance statementRNA secondary structure prediction algorithms are routinely used to understand, predict and design functional RNA structures in biology and biotechnology. Given the vast number of RNA sequence and structural features, these predictions rely on a series of approximations, and independent tests are needed to quantitatively evaluate the accuracy of predicted RNA structural stabilities. Here we measure the stabilities of over 1000 RNA constructs by using a coupled protein binding assay. Our results reveal substantial deviations from the RNA stabilities predicted by popular algorithms, and identify factors contributing to the observed deviations. We demonstrate the importance of quantitative, experimental tests of computational RNA structure predictions and present an approach that can be used to routinely test and improve the prediction accuracy.

Prediction of RNA Secondary Structure Using Quantum-inspired Genetic Algorithms

2020 ◽  
Vol 15 (2) ◽  
pp. 135-143
Author(s):  
Sha Shi ◽  
Xin-Li Zhang ◽  
Le Yang ◽  
Wei Du ◽  
Xian-Li Zhao ◽  
...  
Keyword(s):  
Quantum Computing ◽  
Secondary Structure ◽  
Rna Structure ◽  
Structure Prediction ◽  
Rna Secondary Structure ◽  
Prediction Accuracy ◽  
Secondary Structure Prediction ◽  
Minimum Free Energy ◽  
Rna Sequences ◽  
New Strategy

Background: The prediction of RNA secondary structure using optimization algorithms is key to understand the real structure of an RNA. Evolutionary algorithms (EAs) are popular strategies for RNA secondary structure prediction. However, compared to most state-of-the-art software based on DPAs, the performances of EAs are a bit far from satisfactory. Objective: Therefore, a more powerful strategy is required to improve the performances of EAs when applied to the prediciton of RNA secondary structures. Methods: The idea of quantum computing is introduced here yielding a new strategy to find all possible legal paired-bases with the constraint of minimum free energy. The sate of a stem pool with size N is encoded as a population of QGA, which is represented by N quantum bits but not classical bits. The updating of populations is accomplished by so-called quantum crossover operations, quantum mutation operations and quantum rotation operations. Results: The numerical results show that the performances of traditional EAs are significantly improved by using QGA with regard to not only prediction accuracy and sensitivity but also complexity. Moreover, for RNA sequences with middle-short length, QGA even improves the state-of-art software based on DPAs in terms of both prediction accuracy and sensitivity. Conclusion: This work sheds an interesting light on the applications of quantum computing on RNA structure prediction.

scholarly journals A Novel Framework Based on ACO and PSO for RNA Secondary Structure Prediction

2013 ◽  
Vol 2013 ◽  
pp. 1-8 ◽  
Author(s):  
Gang Wang ◽  
Wen-yi Zhang ◽  
Qiao Ning ◽  
Hui-ling Chen
Keyword(s):  
Secondary Structure ◽  
Rna Structure ◽  
Structure Prediction ◽  
Rna Secondary Structure ◽  
Secondary Structure Prediction ◽  
Genetic Diseases ◽  
New Drugs ◽  
Accuracy Rate ◽  
Rna Secondary Structure Prediction ◽  
Comparison Results

Prediction of RNA structure is a useful process for creating new drugs and understanding genetic diseases. In this paper, we proposed a particle swarm optimization (PSO) and ant colony optimization (ACO) based framework (PAF) for RNA secondary structure prediction. PAF consists of crucial stem searching (CSS) and global sequence building (GSB). In CSS, a modified ACO (MACO) is used to search the crucial stems, and then a set of stems are generated. In GSB, we used a modified PSO (MPSO) to construct all the stems in one sequence. We evaluated the performance of PAF on ten sequences, which have length from 122 to 1494. We also compared the performance of PAF with the results obtained from six existing well-known methods, SARNA-Predict, RnaPredict, ACRNA, PSOfold, IPSO, and mfold. The comparison results show that PAF could not only predict structures with higher accuracy rate but also find crucial stems.

New Algorithm for Predicting RNA Secondary Structure with Pseudoknots

2012 ◽  
Vol 532-533 ◽  
pp. 1796-1799 ◽  
Author(s):  
Zhen Dong Liu ◽  
Da Ming Zhu
Keyword(s):  
Secondary Structure ◽  
Rna Structure ◽  
Structure Prediction ◽  
Rna Secondary Structure ◽  
Secondary Structure Prediction ◽  
Experimental Results ◽  
Rna Secondary Structure Prediction ◽  
Rna Molecules ◽  
Specificity And Sensitivity

Pseudoknots are complicated and stable RNA structure. Based on the idea of iteratively forming stable stems, and the character that the stems in RNA molecules are relatively stable, an algorithm is presented to predict RNA secondary structure including pseudoknots, it is an improvement from the previously used algorithm ,the algorithm takes O(n3) time and O(n2) sapce , in predicting accuracy, it outperforms other known algorithm of RNA secondary structure prediction, its performance is tested with the RNA sub-sequences in PseudoBase. The experimental results indicate that the algorithm has good specificity and sensitivity.

PREDICTION OF SECONDARY STRUCTURE OF RNAs WITH PSEUDOKNOTS USING MATCHED FILTERS

2012 ◽  
Vol 20 (04) ◽  
pp. 455-469
Author(s):  
RAJASEKHAR KAKUMANI ◽  
M. OMAIR AHMAD ◽  
VIJAY KUMAR DEVABHAKTUNI
Keyword(s):  
Secondary Structure ◽  
Rna Structure ◽  
Structure Prediction ◽  
Rna Secondary Structure ◽  
Secondary Structure Prediction ◽  
Matched Filter ◽  
Research Problem ◽  
Vital Role ◽  
Rna Sequences ◽  
Biological Functionality

Prediction of ribonucleic acid (RNA) secondary structure is an important task in bioinformatics. The RNA structure is known to influence its biological functionality. RNA secondary structure contains many substructures such as stems, loops and pseudoknots. The substructure pseudoknot occurs in several classes of RNAs, and plays a vital role in many biological processes. Prediction of pseudoknots in RNA is challenging and still an open research problem. Several computational methods based on dynamic programming, genetic algorithms, statistical models, etc., have been proposed with varying success. In this paper, we employ matched filtering approach to determine the RNA secondary structure containing pseudoknots. The central idea is to use a matched filter to identify the longest possible stem patterns in the base-pairing matrix of an RNA. The stem patterns obtained are then used to determine the locations of the other substructures such as loops and pseudoknots present in the RNA. Comparison of the prediction results, for RNA sequences derived from PseudoBase, illustrate the effectiveness and the accuracy of our proposed approach as compared to some of the existing popular RNA secondary structure prediction methods.

Fine-grained parallelism accelerating for RNA secondary structure prediction with pseudoknots based on FPGA

2014 ◽  
Vol 12 (03) ◽  
pp. 1450008
Author(s):  
Fei Xia ◽  
Guoqing Jin
Keyword(s):  
Secondary Structure ◽  
Structure Prediction ◽  
Rna Secondary Structure ◽  
Rna Folding ◽  
Secondary Structure Prediction ◽  
General Purpose ◽  
Prototype System ◽  
Rna Sequences ◽  
Fine Grained ◽  
On Chip

PKNOTS is a most famous benchmark program and has been widely used to predict RNA secondary structure including pseudoknots. It adopts the standard four-dimensional (4D) dynamic programming (DP) method and is the basis of many variants and improved algorithms. Unfortunately, the O(N6) computing requirements and complicated data dependency greatly limits the usefulness of PKNOTS package with the explosion in gene database size. In this paper, we present a fine-grained parallel PKNOTS package and prototype system for accelerating RNA folding application based on FPGA chip. We adopted a series of storage optimization strategies to resolve the "Memory Wall" problem. We aggressively exploit parallel computing strategies to improve computational efficiency. We also propose several methods that collectively reduce the storage requirements for FPGA on-chip memory. To the best of our knowledge, our design is the first FPGA implementation for accelerating 4D DP problem for RNA folding application including pseudoknots. The experimental results show a factor of more than 50x average speedup over the PKNOTS-1.08 software running on a PC platform with Intel Core2 Q9400 Quad CPU for input RNA sequences. However, the power consumption of our FPGA accelerator is only about 50% of the general-purpose micro-processors.

FINE-GRAINED PARALLEL APPLICATION SPECIFIC COMPUTING FOR RNA SECONDARY STRUCTURE PREDICTION ON FPGA

2014 ◽  
Vol 23 (03) ◽  
pp. 1450031
Author(s):  
QIANGHUA ZHU ◽  
FEI XIA ◽  
GUOQING JIN
Keyword(s):  
Dynamic Programming ◽  
Secondary Structure ◽  
Structure Prediction ◽  
Rna Secondary Structure ◽  
Rna Folding ◽  
Secondary Structure Prediction ◽  
Data Reuse ◽  
Data Dependency ◽  
Rna Secondary Structure Prediction ◽  
Fine Grained

RNA secondary structure prediction is one of the important research areas in modern bioinformatics and computational biology. PKNOTS is the most famous benchmark program and has been widely used to predict RNA secondary structure including pseudoknots. It adopts the standard 4D dynamic programming method and is the basis of many variants and improved algorithms. Unfortunately, the O(N6) computing requirements and complicated data dependency greatly limits the usefulness of PKNOTS package with the explosion in gene database size. In this paper, we present a fine-grained parallel PKNOTS algorithm and prototype system for accelerating RNA folding application on field programmable gate-array (FPGA) platform. We improved data locality by converting cycle nested relationship and reorganizing computing order of the elements in source code. We aggressively exploit data reuse, data dependency elimination and memory access scheduling strategies to minimize the need for loading data from external memory. To the best of our knowledge, our design is the first FPGA implementation for accelerating 4D dynamic programming problem for RNA folding application including pseudoknots. The experimental results show a factor of more than 11 × average speedup over the PKNOTS-1.05 software running on a PC platform with AMD Phenom 9650 Quad CPU for input RNA sequences. However, the power consumption of our FPGA accelerator is only about 50% of the general-purpose micro-processors.

Sign in / Sign up

Export Citation Format

Share Document