DocumentCode :
2203387
Title :
Predicting algorithm for RNA pseudoknotted structure
Author :
Liu, Zhendong ; Fu, Chuande
Author_Institution :
Sch. of Comput. Sci. & Technol., Shandong Jianzhu Univ., Jinan, China
fYear :
2011
fDate :
6-8 June 2011
Firstpage :
514
Lastpage :
518
Abstract :
Pseudoknots are a frequent RNA structure. Based on the relative stability of the stems in RNA molecules, an algorithm is presented to predict RNA pseudoknotted structure,the introduced algorithm takes O(n3) time and O(n) space and outperforms other known algorithms in predicting accuracy. This algorithm not only reduces the time complexity to O(n3), but also widens the maximum length of the sequence The experimental results on the RNA sub-sequences in PseudoBase indicate that the algorithm has good accuracy, sensitivity and specificity.
Keywords :
biology computing; computational complexity; macromolecules; PseudoBase; RNA molecules; RNA pseudoknotted structure; RNA subsequences; predicting algorithm; time complexity; Accuracy; Algorithm design and analysis; Complexity theory; Heuristic algorithms; Prediction algorithms; RNA; Sensitivity; NP-complete; RNA pseudoknotted structure; Stem; heuristic Algorithm;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information and Automation (ICIA), 2011 IEEE International Conference on
Conference_Location :
Shenzhen
Print_ISBN :
978-1-4577-0268-6
Electronic_ISBN :
978-1-4577-0269-3
Type :
conf
DOI :
10.1109/ICINFA.2011.5949047
Filename :
5949047
Link To Document :
بازگشت