A local structural prediction algorithm for RNA triple helix structure

1Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

Abstract

Secondary structure prediction (with or without pseudoknots) of an RNA molecule is a well-known problem in computational biology. Most of the existing algorithms have an assumption that each nucleotide can interact with at most one other nucleotide. This assumption is not valid for triple helix structure (a pseudoknotted structure with tertiary interactions). As these structures are found to be important in many biological processes, it is desirable to develop a prediction tool for these structures. We provide the first structural prediction algorithm to handle triple helix structures. Our algorithm runs in O(n 3) time where n is the length of input RNA sequence. The accuracy of the prediction is reasonably high, with average sensitivity and specificity over 80% for base pairs, and over 70% for tertiary interactions. © 2013 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Hsu, B. Y., Wong, T. K. F., Hon, W. K., Liu, X., Lam, T. W., & Yiu, S. M. (2013). A local structural prediction algorithm for RNA triple helix structure. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7986 LNBI, pp. 102–113). Springer Verlag. https://doi.org/10.1007/978-3-642-39159-0_10

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free