A Detailed Analysis of Parallel Speedup in P-RnaPredict - An Evolutionary Algorithm for RNA Secondary Structure Prediction

Ribonucleic acid is vital in numerous stages of protein synthesis; it also possesses important functional and structural roles within the cell. The function of an RNA molecule within a particular organic system is principally determined by its structure. The current physical methods available for structure determination are time-consuming and expensive. Hence, computational methods for structure prediction are sought after. The energies involved by the formation of secondary structure elements are significantly greater than those of tertiary elements. Therefore, RNA structure prediction focuses on secondary structure. We present P-RnaPredict, a parallel evolutionary algorithm for RNA secondary structure prediction. The speedup provided by parallelization is investigated with five sequences, and a dramatic improvement in speedup is demonstrated, especially with longer sequences. An evaluation of the performance of P-RnaPredict in terms of prediction accuracy is made through comparison with 10 individual known structures from 3 RNA classes (5S rRNA, Group I intron 16S rRNA and 16S rRNA) and the mfold dynamic programming algorithm. P-RnaPredict is able to predict structures with higher true positive base pair counts and lower false positives than mfold on certain sequences. P-RnaPredict is available for non-commercial usage. Interested parties should contact Kay C. Wiese (wiese@cs.sfu.ca).

Ribonucleic Acid (RNA) has important structural and functional roles in the cell and plays roles in many stages of protein synthesis. The structure of RNA largely determines its function. Current physical methods for structure determination are time-consuming and expensive, thus the methods for the computational prediction of structure are necessary. Various algorithms that have been used for RNA structure prediction based in minimum free energy include dynamic programming (DP) and meta heuristic algorithms. One of the most recent meta heuristic algorithms is Musician's behavior-inspired harmony search (HS) algorithm that has been successful in numerous complex optimization problems. This paper builds on the previous work of the harmony search algorithm (HSRNAFold) which was used to find the RNA secondary structure with minimum free energy. In this paper, the accuracy of prediction is compared to the dynamic programming technique RNAFold. The results show that HSRNAFold is able to predict more accurate structures than RNAFold for all test sequences.

Fuzzy k-nearest neighbor method is a generalization of nearest neighbor method, the simplest algorithm for pattern classification. One of the important areas for application of the pattern classification is the protein secondary structure prediction, an important topic in the field of bioinformatics. In this work, we develop a parallel algorithm for protein secondary structure prediction, based on the fuzzy k-nearest neighbor method, that uses evolutionary profile obtained from PSI-BLAST (Position Specific Iterative Basic Local Sequence Alignment Tool) as the feature vectors.

A Bayesian statistical algorithm for RNA secondary structure prediction

One of the major challenges in bioinformatics is the prediction of protein secondary structures, which must take precision into account in order to make the understanding of protein function and interactions fluid. In this study, we analyze the hypeparameter behavior of the SVM (Support Vector Machine) algorithm for protein secondary structure prediction from non-homologous datasets. The aim is to optimize the fit of the various SVM hyperparameters such as kernel, regularization parameter C and gamma γ in order to improve accuracy and verify the impact of these combinations in the overall model. We used cross-validation and grid search techniques to facilitate the model's performance, and performed a thorough analysis of the results using metrics such as precision, accuracy, recall and F1-Score while developing suitable visualizations to see how the model performs. The results indicate that using the right combination of hyperparameters can potentially improve model performance. With regard to the choice of hyperparameters in SVM models in bioinformatics, this study highlights their importance particularly for non-homologous datasets in which highly variable sequences are often found.

G-quadruplexes are abundant locally stable structural elements in nucleic acids. The combinatorial theory of RNA structures and the dynamic programming algorithms for RNA secondary structure prediction are extended here to incorporate G-quadruplexes using a simple but plausible energy model. With preliminary energy parameters, we find that the overwhelming majority of putative quadruplex-forming sequences in the human genome are likely to fold into canonical secondary structures instead. Stable G-quadruplexes are strongly enriched, however, in the 5'UTR of protein coding mRNAs.

A Novel Genetic Algorithm for Nucleic Acid Secondary Structure Prediction with Planar Pseudoknots

formula omitted]-HMM and optimal decoding higher-order structures on sequential data

Recent years, RNA secondary structure prediction has attracted much attention of many researchers, which is an important way to grasp the biochemical function of RNA. However, it is very difficult to predict the RNA secondary structure including pseudoknot, which has been identified to be an NP-complete problem. In this paper, a novel multimodal optimization evolutionary algorithm is proposed to optimize the decision space based on the minimum free energy to predict the secondary structure of RNA. Because there exist multiple equivalent secondary structures which represent the same minimum free energy, our algorithm maintain diversity in decision space to find multiple sets of secondary structure simultaneously. The performance of our algorithm is evaluated by PseudoBase instances and compared with some good prediction algorithms. The comparison results show that our method has higher accuracy in RNA secondary structure prediction.

RNA is an important molecule as it serves a key role in the translation from the genetic information encoded in DNA in protein synthesis. Computational techniques for RNA folding suffer from combinatorial explosion. In this paper, a genetic algorithm (GA) will be used to attempt to solve the secondary structure prediction of RNA molecules.KeywordsGenetic AlgorithmTravel Salesman ProblemCrossover OperatorSecondary Structure PredictionRoulette WheelThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

The design of DNA sequences is critical for many research fields such as DNA self-assembly, DNA hybridization arrays, DNA computing, and PCR-based applications. DNA secondary structure prediction is the key part for these DNA nanotechnologies. In this paper, we present a dynamic programming algorithm to predict the secondary structure of single-stranded DNA tiles. The algorithm calculates all possible maximum matches based on the nearest-neighbour model and global energy minimization. Experimental results show that the algorithm performers significantly to predict secondary str uctures for single-stranded DNA tiles.

This work builds on previous research from an EA used to predict secondary structure of RNA molecules. The EA has the goal of predicting which canonical base pairs will form hydrogen bonds and helices. The addition of stacking energies, through INN and INN-HB, to our thermodynamic model has enhanced our predictions. We test three RNA sequences of lengths 118, 543, and 784 nucleotides using a variety of previously successful operators and parameter settings. The accuracy of the predicted structures are compared against those generated by the Nussinov DPA and also to known structures. The EA showed high accuracy of prediction especially on short sequences. On all tested sequences, the EA outperforms the Nussinov DPA.

One of the main research problems in Structural Bioinformatics is related to the prediction of three-dimensional structures (3-D) of polypeptides or proteins. The rate at which amino acid sequences are identified is increasing faster than the 3-D protein structure determination by experimental methods. Computational prediction methods have been developed during the last years, but the problem still remains challenging because of the complexity and high dimensionality of a protein conformational search space. In this article we present a hybrid genetic algorithm for the Protein Structure Prediction (PSP) Problem. A genetic algorithm is combined with a structured population, and it is hybridized with a path-relinking procedure that helps the algorithm to scape from local minima. We perform a set of experiments and show that the proposed hybrid genetic algorithm is effective in finding good quality solutions for the PSP Problem.

A Hinged Signal Peptide Hairpin Enables Tat-Dependent Protein Translocation

19] Computer modeling and display of RNA secondary and tertiary structures