DSARna: RNA Secondary Structure Alignment Based on Digital Sequence Representation

Author(s):  
Longjian Gao ◽  
Chengzhen Xu ◽  
Wangan Song ◽  
Feng Xiao ◽  
Xiaomin Wu ◽  
...  

Background: With increasing applications and development of high-throughput sequencing, knowledge of the primary structure of RNA has expanded exponentially. Moreover, the function of RNA is determined by the secondary or higher RNA structure, and similar structures are related to similar functions, such as the secondary clover structure of tRNA. Therefore, RNA structure alignment is an important subject in computational biology and bioinformatics to accurately predict function. However, the traditional RNA structure alignment algorithms have some drawbacks such as high complexity and easy loss of secondary structure information. Objective: To study RNA secondary structure alignment according to the shortcomings of existing secondary structure alignment algorithms and the characteristics of RNA secondary structure. Method: We propose a new digital sequence RNA structure representation algorithm named “DSARna” . Then based on a dynamic programming algorithm, the scoring matrix and binary path matrix are simultaneously constructed. The backtracking path is identified in the path matrix, and the optimal result is predicted according to the path length. Conclusions: Upon comparison with the existing SimTree algorithm through experimental analysis, the proposed method showed higher accuracy and could ensure that the structural information is not easily lost in terms of improved specificity, sensitivity, and the Matthews correlation coefficient.

2013 ◽  
Vol 325-326 ◽  
pp. 1551-1554
Author(s):  
Yi Qi

In this paper, we present an improved BPSO to predict RNA secondary structure to improve the performance with two new strategies. First one is to reduce the searching space of PSO through super stem set construction. Second is to modify the general BPSO updating process to settle stem permutation and combination problems. The experimental results show that the new method is effective for RNA structure prediction in terms of sensitivity and specificity by different sequence datasets including simple pseudoknot.


2011 ◽  
Vol 111 (5) ◽  
pp. 978-982 ◽  
Author(s):  
Zhi Cao ◽  
Bo Liao ◽  
Renfa Li ◽  
Jiawei Luo ◽  
Wen Zhu

2016 ◽  
Vol 17 (1) ◽  
Author(s):  
Nathan D. Berkowitz ◽  
Ian M. Silverman ◽  
Daniel M. Childress ◽  
Hilal Kazan ◽  
Li-San Wang ◽  
...  

2016 ◽  
Vol 14 (04) ◽  
pp. 1643001 ◽  
Author(s):  
Jin Li ◽  
Chengzhen Xu ◽  
Lei Wang ◽  
Hong Liang ◽  
Weixing Feng ◽  
...  

Prediction of RNA secondary structures is an important problem in computational biology and bioinformatics, since RNA secondary structures are fundamental for functional analysis of RNA molecules. However, small RNA secondary structures are scarce and few algorithms have been specifically designed for predicting the secondary structures of small RNAs. Here we propose an algorithm named “PSRna” for predicting small-RNA secondary structures using reverse complementary folding and characteristic hairpin loops of small RNAs. Unlike traditional algorithms that usually generate multi-branch loops and 5[Formula: see text] end self-folding, PSRna first estimated the maximum number of base pairs of RNA secondary structures based on the dynamic programming algorithm and a path matrix is constructed at the same time. Second, the backtracking paths are extracted from the path matrix based on backtracking algorithm, and each backtracking path represents a secondary structure. To improve accuracy, the predicted RNA secondary structures are filtered based on their free energy, where only the secondary structure with the minimum free energy was identified as the candidate secondary structure. Our experiments on real data show that the proposed algorithm is superior to two popular methods, RNAfold and RNAstructure, in terms of sensitivity, specificity and Matthews correlation coefficient (MCC).


Sign in / Sign up

Export Citation Format

Share Document