Nucleic Acids Research Advance Access originally published online on December 19, 2006
Nucleic Acids Research 2007 35(2):656-663; doi:10.1093/nar/gkl943
| ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
Nucleic Acids Research, 2007, Vol. 35, No. 2 656-663
© 2006 The Author(s).
This is an Open Access article distributed under the terms of the Creative Commons Attribution Non-Commercial License (http://creativecommons.org/licenses/by-nc/2.0/uk/) which permits unrestricted non-commercial use, distribution, and reproduction in any medium, provided the original work is properly cited.
Computational Biology |
High sensitivity RNA pseudoknot prediction
1Department of Pathology and Microbiology, University of Nebraska Medical Center Omaha, NE 68198, USA 2 Department of Computer Science, College of Information Science and Technology, University of Nebraska at Omaha Omaha, NE 68182, USA
*To whom correspondence should be addressed. Tel/Fax: +1 402 554 3623; Email: hesham{at}unomaha.edu
Received June 17, 2006. Revised October 19, 2006. Accepted October 20, 2006.
Most ab initio pseudoknot predicting methods provide very few folding scenarios for a given RNA sequence and have low sensitivities. RNA researchers, in many cases, would rather sacrifice the specificity for a much higher sensitivity for pseudoknot detection. In this study, we introduce the Pseudoknot Local Motif Model and Dynamic Partner Sequence Stacking (PLMM_DPSS) algorithm which predicts all PLM model pseudoknots within an RNA sequence in a neighboring-region-interference-free fashion. The PLM model is derived from the existing Pseudobase entries. The innovative DPSS approach calculates the optimally lowest stacking energy between two partner sequences. Combined with the Mfold, PLMM_DPSS can also be used in predicting complicated pseudoknots. The test results of PLMM_DPSS, PKNOTS, iterated loop matching, pknotsRG and HotKnots with Pseudobase sequences have shown that PLMM_DPSS is the most sensitive among the five methods. PLMM_DPSS also provides manageable pseudoknot folding scenarios for further structure determination.
CiteULike 
Connotea 
Del.icio.us What's this?
This article has been cited by other articles:
|
|
 |
|
  S. Cao and S.-J. Chen Predicting structures and stabilities for H-type pseudoknots with interhelix loops RNA, April 1, 2009; 15(4): 696 - 706. [Abstract] [Full Text] [PDF]
|
|
|
|
 |
|
 X. Chen, S.-M. He, D. Bu, F. Zhang, Z. Wang, R. Chen, and W. Gao FlexStem: improving predictions of RNA secondary structures with pseudoknots by reducing the search space Bioinformatics, September 15, 2008; 24(18): 1994 - 2001. [Abstract] [Full Text] [PDF]
|
|
|
|
|
|
J. Sperschneider and A. Datta KnotSeeker: Heuristic pseudoknot detection in long RNA sequences RNA, April 1, 2008; 14(4): 630 - 640. [Abstract] [Full Text] [PDF]
|
|
|
|
|
|
S. Smit, K. Rother, J. Heringa, and R. Knight From knotted to nested RNA structures: A variety of computational methods for pseudoknot removal RNA, March 1, 2008; 14(3): 410 - 416. [Abstract] [Full Text] [PDF]
|
|