Ribonucleic Acid Secondary Structure Research Articles

Scaling properties of RNA as a randomly branching polymer.

Formation of base pairs between the nucleotides of a ribonucleic acid (RNA) sequence gives rise to a complex and often highly branched RNA structure. While numerous studies have demonstrated the functional importance of the high degree of RNA branching-for instance, for its spatial compactness or interaction with other biological macromolecules-RNA branching topology remains largely unexplored. Here, we use the theory of randomly branching polymers to explore the scaling properties of RNAs by mapping their secondary structures onto planar tree graphs. Focusing on random RNA sequences of varying lengths, we determine the two scaling exponents related to their topology of branching. Our results indicate that ensembles of RNA secondary structures are characterized by annealed random branching and scale similarly to self-avoiding trees in three dimensions. We further show that the obtained scaling exponents are robust upon changes in nucleotide composition, tree topology, and folding energy parameters. Finally, in order to apply the theory of branching polymers to biological RNAs, whose length cannot be arbitrarily varied, we demonstrate how both scaling exponents can be obtained from distributions of the related topological quantities of individual RNA molecules with fixed length. In this way, we establish a framework to study the branching properties of RNA and compare them to other known classes of branched polymers. By understanding the scaling properties of RNA related to its branching structure, we aim to improve our understanding of the underlying principles and open up the possibility to design RNA sequences with desired topological properties.

BpRNA-align: improved RNA secondary structure global alignment for comparing and clustering RNA structures.

Ribonucleic acid (RNA) is a polymeric molecule that is fundamental to biological processes, with structure being more highly conserved than primary sequence and often key to its function. Advances in RNA structure characterization have resulted in an increase in the number of accurate secondary structures. The task of uncovering common RNA structural motifs with a collective function through structural comparison, providing a level of similarity, remains challenging and could be used to improve RNA secondary structure databases and discover new RNA families. In this work, we present a novel secondary structure alignment method, bpRNA-align. bpRNA-align is a customized global structural alignment method, utilizing an inverted (gap extend costs more than gap open) and context-specific affine gap penalty along with a structural, feature-specific substitution matrix to provide similarity scores. We evaluate our similarity scores in comparison to other methods, using affinity propagation clustering, applied to a benchmarking data set of known structure types. bpRNA-align shows improvement in clustering performance over a broad range of structure types.

ExpertRNA: A New Framework for RNA Secondary Structure Prediction

Ribonucleic acid (RNA) is a fundamental biological molecule that is essential to all living organisms, performing a versatile array of cellular tasks. The function of many RNA molecules is strongly related to the structure it adopts. As a result, great effort is being dedicated to the design of efficient algorithms that solve the “folding problem”—given a sequence of nucleotides, return a probable list of base pairs, referred to as the secondary structure prediction. Early algorithms largely rely on finding the structure with minimum free energy. However, the predictions rely on effective simplified free energy models that may not correctly identify the correct structure as the one with the lowest free energy. In light of this, new, data-driven approaches that not only consider free energy, but also use machine learning techniques to learn motifs are also investigated and recently been shown to outperform free energy–based algorithms on several experimental data sets. In this work, we introduce the new ExpertRNA algorithm that provides a modular framework that can easily incorporate an arbitrary number of rewards (free energy or nonparametric/data driven) and secondary structure prediction algorithms. We argue that this capability of ExpertRNA has the potential to balance out different strengths and weaknesses of state-of-the-art folding tools. We test ExpertRNA on several RNA sequence-structure data sets, and we compare the performance of ExpertRNA against a state-of-the-art folding algorithm. We find that ExpertRNA produces, on average, more accurate predictions of nonpseudoknotted secondary structures than the structure prediction algorithm used, thus validating the promise of the approach. Summary of Contribution: ExpertRNA is a new algorithm inspired by a biological problem. It is applied to solve the problem of secondary structure prediction for RNA molecules given an input sequence. The computational contribution is given by the design of a multibranch, multiexpert rollout algorithm that enables the use of several state-of-the-art approaches as base heuristics and allowing several experts to evaluate partial candidate solutions generated, thus avoiding assuming the reward being optimized by an RNA molecule when folding. Our implementation allows for the effective use of parallel computational resources as well as to control the size of the rollout tree as the algorithm progresses. The problem of RNA secondary structure prediction is of primary importance within the biology field because the molecule structure is strongly related to its functionality. Whereas the contribution of the paper is in the algorithm, the importance of the application makes ExpertRNA a showcase of the relevance of computationally efficient algorithms in supporting scientific discovery.

Knotify: An Efficient Parallel Platform for RNA Pseudoknot Prediction Using Syntactic Pattern Recognition.

Obtaining valuable clues for noncoding RNA (ribonucleic acid) subsequences remains a significant challenge, acknowledging that most of the human genome transcribes into noncoding RNA parts related to unknown biological operations. Capturing these clues relies on accurate “base pairing” prediction, also known as “RNA secondary structure prediction”. As COVID-19 is considered a severe global threat, the single-stranded SARS-CoV-2 virus reveals the importance of establishing an efficient RNA analysis toolkit. This work aimed to contribute to that by introducing a novel system committed to predicting RNA secondary structure patterns (i.e., RNA’s pseudoknots) that leverage syntactic pattern-recognition strategies. Having focused on the pseudoknot predictions, we formalized the secondary structure prediction of the RNA to be primarily a parsing and, secondly, an optimization problem. The proposed methodology addresses the problem of predicting pseudoknots of the first order (H-type). We introduce a context-free grammar (CFG) that affords enough expression power to recognize potential pseudoknot pattern. In addition, an alternative methodology of detecting possible pseudoknots is also implemented as well, using a brute-force algorithm. Any input sequence may highlight multiple potential folding patterns requiring a strict methodology to determine the single biologically realistic one. We conscripted a novel heuristic over the widely accepted notion of free-energy minimization to tackle such ambiguity in a performant way by utilizing each pattern’s context to unveil the most prominent pseudoknot pattern. The overall process features polynomial-time complexity, while its parallel implementation enhances the end performance, as proportional to the deployed hardware. The proposed methodology does succeed in predicting the core stems of any RNA pseudoknot of the test dataset by performing a 76.4% recall ratio. The methodology achieved a F1-score equal to 0.774 and MCC equal 0.543 in discovering all the stems of an RNA sequence, outperforming the particular task. Measurements were taken using a dataset of 262 RNA sequences establishing a performance speed of 1.31, 3.45, and 7.76 compared to three well-known platforms. The implementation source code is publicly available under knotify github repo.

Cotranscriptional Kinetic Folding of RNA Secondary Structures Including Pseudoknots.

Computational prediction of ribonucleic acid (RNA) structures is an important problem in computational structural biology. Studies of RNA structure formation often assume that the process starts from a fully synthesized sequence. Experimental evidence, however, has shown that RNA folds concurrently with its elongation. We investigate RNA secondary structure formation, including pseudoknots, that takes into account the cotranscriptional effects. We propose a single-nucleotide resolution kinetic model of the folding process of RNA molecules, where the polymerase-driven elongation of an RNA strand by a new nucleotide is included as a primitive operation, together with a stochastic simulation method that implements this folding concurrently with the transcriptional synthesis. Numerical case studies show that our cotranscriptional RNA folding model can predict the formation of conformations that are favored in actual biological systems. Our new computational tool can thus provide quantitative predictions and offer useful insights into the kinetics of RNA folding.

NNfold: RNA Secondary Structure Prediction by Deep Learning with an Architecture Imposing Contextual Constraining

Ribonucleic acid (RNA) secondary structures are the determining factor for the many roles RNA plays in life. They can be obtained experimentally by techniques such as X-ray diffraction and NMR imaging. However, given that experimental methods are laborious and expensive, they are not fit for high throughput analysis. Computational prediction algorithms are complementary in predicting the RNA secondary structures for the multitude of known RNA sequences lacking structural information. Here, we introduce NNfold, a novel sequence-based deep neural network method to predict RNA secondary structures. The predictions are made by combining a local and a global model: first, we construct a matrix with the pairing likelihood of each nucleotide by predicting all potential interactions using a convolutional deep learning model. Next, we modify the list of base pairs obtained from the matrix using a second model whose output is used to ensure the contextual validity of the predicted secondary structure. Within the RNA Strand database, NNfold performed much better than thermodynamics-based methods on a diverse set of RNA sequences, improving the average F1 score by 0.20. It is capable of predicting pseudoknots which is a challenging task for other approaches. We also extracted the learned thermodynamic features within the model, which can help advance the construction of new biological models to predict RNA secondary structures. Our developed method is available as a service online at http://www.cbrc.kaust.edu.sa/NNfold/, or as an installable package at https://github.com/ramzan1990/NNfold.

Graph-Based Analysis of RNA Secondary Structure Similarity Comparison

In organisms, ribonucleic acid (RNA) plays an essential role. Its function is being discovered more and more. Due to the conserved nature of RNA sequences, its function mainly depends on the RNA secondary structure. The discovery of an approximate relationship between two RNA secondary structures helps to understand their functional relationship better. It is an important and urgent task to explore structural similarities from the graphical representation of RNA secondary structures. In this paper, a novel graphical analysis method based on the triple vector curve representation of RNA secondary structures is proposed. A combinational method involving a discrete wavelet transform (DWT) and fractal dimension with sliding window is introduced to analyze and compare the graphs derived from feature extraction; after that, the distance matrix is generated. Then, the distance matrix is analyzed by clustering and visualized as a clustering tree. RNA virus and noncoding RNA datasets are applied to perform experiments and analyze the clustering tree. The results show that the proposed method yields more accurate results in the comparison of RNA secondary structures.

Markov Chain-Based Sampling for Exploring RNA Secondary Structure under the Nearest Neighbor Thermodynamic Model and Extended Applications.

Ribonucleic acid (RNA) secondary structures and branching properties are important for determining functional ramifications in biology. While energy minimization of the Nearest Neighbor Thermodynamic Model (NNTM) is commonly used to identify such properties (number of hairpins, maximum ladder distance, etc.), it is difficult to know whether the resultant values fall within expected dispersion thresholds for a given energy function. The goal of this study was to construct a Markov chain capable of examining the dispersion of RNA secondary structures and branching properties obtained from NNTM energy function minimization independent of a specific nucleotide sequence. Plane trees are studied as a model for RNA secondary structure, with energy assigned to each tree based on the NNTM, and a corresponding Gibbs distribution is defined on the trees. Through a bijection between plane trees and 2-Motzkin paths, a Markov chain converging to the Gibbs distribution is constructed, and fast mixing time is established by estimating the spectral gap of the chain. The spectral gap estimate is obtained through a series of decompositions of the chain and also by building on known mixing time results for other chains on Dyck paths. The resulting algorithm can be used as a tool for exploring the branching structure of RNA, especially for long sequences, and to examine branching structure dependence on energy model parameters. Full exposition is provided for the mathematical techniques used with the expectation that these techniques will prove useful in bioinformatics, computational biology, and additional extended applications.

Designing RNA Secondary Structures Is Hard.

A ribonucleic acid (RNA) sequence is a word over an alphabet on four elements [Formula: see text] called bases. RNA sequences fold into secondary structures where some bases pair with one another, while others remain unpaired. The two fundamental problems in RNA algorithmic are to predict how sequences fold within some models of energy and to design sequences of bases that will fold into targeted secondary structures. Predicting how a given RNA sequence folds into a pseudoknot-free secondary structure is known to be solvable in cubic time since the eighties and in truly subcubic time by a recent result of Bringmann et al. (FOCS, 2016), whereas Lyngsø has shown it is computationally hard if pseudoknots are allowed (ICALP, 2004). As a stark contrast, it is unknown whether or not designing a given RNA secondary structure is a tractable task; this has been raised as a challenging open question by Condon (ICALP, 2003). Because of its crucial importance in a number of fields such as pharmaceutical research and biochemistry, there are dozens of heuristics and software libraries dedicated to the RNA secondary structure design. It is therefore rather surprising that the computational complexity of this central problem in bioinformatics has been unsettled for decades. In this article, we show that in the simplest model of energy, which is the Watson-Crick model, the design of secondary structures is computationally hard if one adds natural constraints of the form: indexiof the sequence has to be labeled by baseb. This negative result suggests that the same lower bound holds for more realistic models of energy. It is noteworthy that the additional constraints are by no means artificial: they are provided by all the RNA design pieces of software and they do correspond to the actual practice (e.g., the instances of the EteRNA project).

Conditional Prediction of Ribonucleic Acid Secondary Structure Using Chemical Shifts.

Inspired by methods that utilize chemical-mapping data to guide secondary structure prediction, we sought to develop a framework for using assigned chemical shift data to guide ribonucleic acid (RNA) secondary structure prediction. We first used machine learning to develop classifiers that predict the base-pairing status of individual residues in an RNA based on their assigned chemical shifts. Then, we used these base-pairing status predictions as restraints to guide RNA folding algorithms. Our results showed that we could recover the correct secondary fold of most of the 108 RNAs in our data set with remarkable accuracy. Finally, we tested whether we could use the base-pairing status predictions that we obtained from assigned chemical shift data to conditionally predict the secondary structure of RNA. To achieve this, we attempted to model two distinct conformational states of the microRNA-20b and the fluoride riboswitch using assigned chemical shifts that were available for both conformational states of each of these test RNAs. For both test cases, we found that by using the base-pairing status predictions that we obtained from assigned chemical shift data as folding restraints, we could generate structures that closely resembled the known structure of the two distinct states. A command-line tool for chemical shifts to base-pairing status predictions in RNA has been incorporated into our CS2Structure Git repository and can be accessed via https://github.com/atfrank/CS2Structure .

Nature inspired optimization algorithm for prediction of “minimum free energy” “RNA secondary structure”

Over the last few years, many optimization algorithms have been developed to predict the optimal secondary structure of ribonucleic acid (RNA) with “minimum free energy” (MFE). These algorithms are either inspired by dynamic programming or by meta-heuristic techniques. RNA participates in several biological activities in the organism. These activities involve protein synthesis, understanding the functional behavior of RNA molecules, coding, decoding and gene expression, carrier of transferring genetic information, formation of protein, catalyst in biomedical reactions and structural molecule in cellular organelles, transcription, etc. Beside the said activities, the major role of RNA is in developing new drugs and understanding several diseases occurred due to genetic disorder and viruses. For the above said activities, it is required to predict the correct RNA secondary structure having minimum free energy with desired prediction accuracy. This paper presents a meta-heuristic optimization algorithm to obtain the optimal secondary structure of RNA with required functionality and requires less time than the others in the literature. The performance of the proposed algorithm is checked with different existing state-of-the-art techniques. It is found that the proposed algorithm gives better results against the other techniques.

PourRNA-a time- and memory-efficient approach for the guided exploration of RNA energy landscapes.

The folding dynamics of ribonucleic acids (RNAs) are typically studied via coarse-grained models of the underlying energy landscape to face the exponential growths of the RNA secondary structure space. Still, studies of exact folding kinetics based on gradient basin abstractions are currently limited to short sequence lengths due to vast memory requirements. In order to compute exact transition rates between gradient basins, state-of-the-art approaches apply global flooding schemes that require to memorize the whole structure space at once. pourRNA tackles this problem via local flooding techniques where memorization is limited to the structure ensembles of individual gradient basins. Compared to the only available tool for exact gradient basin-based macro-state transition rates (namely barriers), pourRNA computes the same exact transition rates up to 10 times faster and requires two orders of magnitude less memory for sequences that are still computationally accessible for exhaustive enumeration. Parallelized computation as well as additional heuristics further speed up computations while still producing high-quality transition model approximations. The introduced heuristics enable a guided trade-off between model quality and required computational resources. We introduce and evaluate a macroscopic direct path heuristics to efficiently compute refolding energy barrier estimations for the co-transcriptionally trapped RNA sv11 of length 115 nt. Finally, we also show how pourRNA can be used to identify folding funnels and their respective energetically lowest minima. pourRNA is freely available at https://github.com/ViennaRNA/pourRNA. Supplementary data are available at Bioinformatics online.

Modeling of RNA secondary structures using two-way quantum finite automata

Quantum finite automata (QFA) play a crucial role in quantum information processing theory. The representation of ribonucleic acid (RNA) and deoxyribonucleic acid (DNA) structures using theory of automata had a great influence in the computer science. Investigation of the relationship between QFA and RNA structures is a natural goal. Two-way quantum finite automata (2QFA) is more dominant than its classical model in language recognition. Motivated by the concept of quantum finite automata, we have modeled RNA secondary structure loops such as, internal loop and double helix loop using two-way quantum finite automata. The major benefit of this approach is that these sequences can be parsed in linear time. In contrast, two-way deterministic finite automata (2DFA) cannot represent RNA secondary structure loops and two-way probabilistic finite automata (2PFA) can parse these sequences in exponential time. To the best of authors knowledge this is the first attempt to represent RNA secondary structure loops using two-way quantum finite automata.

An Efficient Dual Sampling Algorithm with Hamming Distance Filtration.

Recently, a framework considering ribonucleic acid (RNA) sequences and their RNA secondary structures as pairs has led to new information theoretic perspectives on how the semantics encoded in RNA sequences can be inferred. In this context, the pairing arises naturally from the energy model of RNA secondary structures. Fixing the sequence in the pairing produces the RNA energy landscape, whose partition function was discovered by McCaskill. Dually, fixing the structure induces the energy landscape of sequences. The latter has been considered for designing more efficient inverse folding algorithms. In this work, we present the dual partition function filtered by Hamming distance, together with a Boltzmann sampler using novel dynamic programming routines for the loop-based energy model. The time complexity of the algorithm is [Formula: see text], where [Formula: see text] are Hamming distance and sequence length, respectively, reducing the time complexity of samplers, reported in the literature by [Formula: see text]. We then present two applications, the first in the context of the evolution of natural sequence-structure pairs of microRNAs and the second in constructing neutral paths. The former studies the inverse folding rate (IFR) of sequence-structure pairs, filtered by Hamming distance, observing that such pairs evolve toward higher levels of robustness, that is, increasing IFR. The latter is an algorithm that constructs neutral paths: given two sequences in a neutral network, we employ the sampler to construct short paths connecting them, consisting of sequences all contained in the neutral network.

DCJ-RNA - double cut and join for RNA secondary structures

BackgroundGenome rearrangements are essential processes for evolution and are responsible for existing varieties of genome architectures. Many studies have been conducted to obtain an algorithm that identifies the minimum number of inversions that are necessary to transform one genome into another; this allows for genome sequence representation in polynomial time. Studies have not been conducted on the topic of rearranging a genome when it is represented as a secondary structure. Unlike sequences, the secondary structure preserves the functionality of the genome. Sequences can be different, but they all share the same structure and, therefore, the same functionality.ResultsThis paper proposes a double cut and join for RNA secondary structures (DCJ-RNA) algorithm. This algorithm allows for the description of evolutionary scenarios that are based on secondary structures rather than sequences. The main aim of this paper is to suggest an efficient algorithm that can help researchers compare two ribonucleic acid (RNA) secondary structures based on rearrangement operations. The results, which are based on real datasets, show that the algorithm is able to count the minimum number of rearrangement operations, as well as to report an optimum scenario that can increase the similarity between the two structures.ConclusionThe algorithm calculates the distance between structures and reports a scenario based on the minimum rearrangement operations required to make the given structure similar to the other. DCJ-RNA can also be used to measure the distance between the two structures. This can help identify the common functionalities between different species.

Classification and predictions of RNA pseudoknots based on topological invariants.

We propose a new topological characterization of ribonucleic acid (RNA) secondary structures with pseudoknots based on two topological invariants. Starting from the classic arc representation of RNA secondary structures, we consider a model that couples both (i) the topological genus of the graph and (ii) the number of crossing arcs of the corresponding primitive graph. We add a term proportional to these topological invariants to the standard free energy of the RNA molecule, thus obtaining a novel free-energy parametrization that takes into account the abundance of topologies of RNA pseudoknots observed in RNA databases.

Cisplatin Targeting of Bacterial Ribosomal RNA Hairpins.

Cisplatin is a clinically important chemotherapeutic agent known to target purine bases in nucleic acids. In addition to major deoxyribonucleic acid (DNA) intrastrand cross-links, cisplatin also forms stable adducts with many types of ribonucleic acid (RNA) including siRNA, spliceosomal RNAs, tRNA, and rRNA. All of these RNAs play vital roles in the cell, such as catalysis of protein synthesis by rRNA, and therefore serve as potential drug targets. This work focused on platination of two highly conserved RNA hairpins from E. coli ribosomes, namely pseudouridine-modified helix 69 from 23S rRNA and the 790 loop of helix 24 from 16S rRNA. RNase T1 probing, MALDI mass spectrometry, and dimethyl sulfate mapping revealed platination at GpG sites. Chemical probing results also showed platination-induced RNA structural changes. These findings reveal solvent and structural accessibility of sites within bacterial RNA secondary structures that are functionally significant and therefore viable targets for cisplatin as well as other classes of small molecules. Identifying target preferences at the nucleotide level, as well as determining cisplatin-induced RNA conformational changes, is important for the design of more potent drug molecules. Furthermore, the knowledge gained through studies of RNA-targeting by cisplatin is applicable to a broad range of organisms from bacteria to human.

A novel approach to represent and compare RNA secondary structures.

Structural information is crucial in ribonucleic acid (RNA) analysis and functional annotation; nevertheless, how to include such structural data is still a debated problem. Dot-bracket notation is the most common and simple representation for RNA secondary structures but its simplicity leads also to ambiguity requiring further processing steps to dissolve. Here we present BEAR (Brand nEw Alphabet for RNA), a new context-aware structural encoding represented by a string of characters. Each character in BEAR encodes for a specific secondary structure element (loop, stem, bulge and internal loop) with specific length. Furthermore, exploiting this informative and yet simple encoding in multiple alignments of related RNAs, we captured how much structural variation is tolerated in RNA families and convert it into transition rates among secondary structure elements. This allowed us to compute a substitution matrix for secondary structure elements called MBR (Matrix of BEAR-encoded RNA secondary structures), of which we tested the ability in aligning RNA secondary structures. We propose BEAR and the MBR as powerful resources for the RNA secondary structure analysis, comparison and classification, motif finding and phylogeny.

Enhancement of accuracy and efficiency for RNA secondary structure prediction by sequence segmentation and MapReduce

BackgroundRibonucleic acid (RNA) molecules play important roles in many biological processes including gene expression and regulation. Their secondary structures are crucial for the RNA functionality, and the prediction of the secondary structures is widely studied. Our previous research shows that cutting long sequences into shorter chunks, predicting secondary structures of the chunks independently using thermodynamic methods, and reconstructing the entire secondary structure from the predicted chunk structures can yield better accuracy than predicting the secondary structure using the RNA sequence as a whole. The chunking, prediction, and reconstruction processes can use different methods and parameters, some of which produce more accurate predictions than others. In this paper, we study the prediction accuracy and efficiency of three different chunking methods using seven popular secondary structure prediction programs that apply to two datasets of RNA with known secondary structures, which include both pseudoknotted and non-pseudoknotted sequences, as well as a family of viral genome RNAs whose structures have not been predicted before. Our modularized MapReduce framework based on Hadoop allows us to study the problem in a parallel and robust environment.ResultsOn average, the maximum accuracy retention values are larger than one for our chunking methods and the seven prediction programs over 50 non-pseudoknotted sequences, meaning that the secondary structure predicted using chunking is more similar to the real structure than the secondary structure predicted by using the whole sequence. We observe similar results for the 23 pseudoknotted sequences, except for the NUPACK program using the centered chunking method. The performance analysis for 14 long RNA sequences from the Nodaviridae virus family outlines how the coarse-grained mapping of chunking and predictions in the MapReduce framework exhibits shorter turnaround times for short RNA sequences. However, as the lengths of the RNA sequences increase, the fine-grained mapping can surpass the coarse-grained mapping in performance.ConclusionsBy using our MapReduce framework together with statistical analysis on the accuracy retention results, we observe how the inversion-based chunking methods can outperform predictions using the whole sequence. Our chunk-based approach also enables us to predict secondary structures for very long RNA sequences, which is not feasible with traditional methods alone.

PREDICTION OF SECONDARY STRUCTURE OF RNAs WITH PSEUDOKNOTS USING MATCHED FILTERS

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.