Skip Navigation



Bioinformatics Advance Access published online on February 10, 2006

Bioinformatics, doi:10.1093/bioinformatics/btl043
This Article
Right arrow Advance Access manuscript (PDF) Freely available
Right arrowOA All Versions of this Article:
22/8/934    most recent
btl043v1
Right arrow Comments: Submit a response
Right arrow Alert me when this article is cited
Right arrow Alert me when Comments are posted
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in PubMed
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Google Scholar
Right arrow Articles by Wiese, K. C.
Right arrow Articles by Hendriks, A.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Wiese, K. C.
Right arrow Articles by Hendriks, A.
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© The Author (2006). Published by Oxford University Press. All rights reserved. For Permissions, please email: journals.permissions@oxfordjournals.org
Received November 4, 2005
Revised February 2, 2006
Accepted February 3, 2006

Article

Comparison of P-RnaPredict and mfold - algorithms for RNA secondary structure prediction

Kay C. Wiese 1 * and Andrew Hendriks 1

1 School of Computing Science and InfoNet Media Centre, Simon Fraser University, 15th Floor, Central City Tower, 13450 102nd Ave., Surrey, B.C., Canada, V3T 5X3

* To whom correspondence should be addressed.
Kay C. Wiese, E-mail: wiese{at}cs.sfu.ca


   Abstract

Motivation: Ribonucleic acid (RNA) is vital in numerous stages of protein synthesis; it also possesses important functional and structural roles within the cell. The function of a 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 through formation of secondary structure elements are significantly greater than those of tertiary elements. Therefore, RNA structure prediction focuses on secondary structure.

Results: We present P-RnaPredict, a parallel evolutionary algorithm (EA) for RNA secondary structure prediction. The speedup provided by parallelization is investigated with 5 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 to 10 individual known structures from 3 RNA classes (5S rRNA, Group I intron 16S rRNA, and 16S rRNA) and the mfold (Zuker, 2003) dynamic programming algorithm (DPA). P-RnaPredict is able to predict structures with higher true positive base pair counts and lower false positives than mfold on certain sequences.

Availability: P-RnaPredict is available for non-commercial usage. Interested parties should contact Kay C. Wiese (wiese@cs.sfu.ca).


Associate Editor: Anna Tramontano
Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?


This article has been cited by other articles:


Home page
Proc. Natl. Acad. Sci. USAHome page
M. Rabani, M. Kertesz, and E. Segal
Computational prediction of RNA structural motifs involved in posttranscriptional regulatory processes
PNAS, September 30, 2008; 105(39): 14885 - 14890.
[Abstract] [Full Text] [PDF]


Home page
Brief BioinformHome page
G. B. Fogel
Computational intelligence approaches for pattern discovery in biological systems
Brief Bioinform, July 1, 2008; 9(4): 307 - 316.
[Abstract] [Full Text] [PDF]



Disclaimer: Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.