Preprint Article Version 1 This version is not peer-reviewed

Grammar-Based Computational Framework for Predicting Pseudoknots of K-Type and M-Type in RNA Secondary Structures

Version 1 : Received: 13 August 2024 / Approved: 14 August 2024 / Online: 14 August 2024 (14:39:34 CEST)

How to cite: Pavlatos, C. Grammar-Based Computational Framework for Predicting Pseudoknots of K-Type and M-Type in RNA Secondary Structures. Preprints 2024, 2024081078. https://doi.org/10.20944/preprints202408.1078.v1 Pavlatos, C. Grammar-Based Computational Framework for Predicting Pseudoknots of K-Type and M-Type in RNA Secondary Structures. Preprints 2024, 2024081078. https://doi.org/10.20944/preprints202408.1078.v1

Abstract

Understanding the structural intricacies of RNA molecules is essential for deciphering numerous biological processes. Traditionally, scientists have relied on experimental methods to gain insights and draw conclusions. However, the recent advent of advanced computational techniques has significantly accelerated and refined the accuracy of research results in several areas. A particularly challenging aspect of RNA analysis is the prediction of its secondary structure, which is crucial for elucidating its functional role in biological systems. This paper deals with the prediction of pseudoknots in RNA, focusing on two types of pseudoknots: K-type and M-type pseudoknots. Pseudoknots are complex RNA formations in which nucleotides in a loop form base pairs with nucleotides outside the loop and thus contribute to essential biological functions. Accurate prediction of these structures is crucial for understanding RNA dynamics and interactions. Building on our previous work in which we developed a framework for the recognition of H- and L-type pseudoknots, an extended grammar-based framework tailored to the prediction of K- and M-type pseudoknots is proposed. This approach uses syntactic pattern recognition techniques and provides a systematic method to identify and characterize these complex RNA structures. Our framework uses context-free grammars (CFGs) to model RNA sequences and predict the occurrence of pseudoknots. By formulating specific grammatical rules for type K and type M pseudoknots, we enable efficient parsing of RNA sequences to recognize potential pseudoknot configurations. This method ensures an exhaustive exploration of possible pseudoknot structures within a reasonable time frame. In addition, the proposed method incorporates essential concepts of biology, such as base pairing optimization and free energy reduction, to improve the accuracy of pseudoknot prediction. These principles are crucial to ensure that the predicted structures are biologically plausible. By embedding these principles into our grammar-based framework, we aim to predict RNA conformations that are both theoretically sound and biologically relevant.

Keywords

RNA structure prediction; K-type pseudoknots; M-type pseudoknots; syntactic pattern recognition; context-free grammar; secondary structure; computational biology

Subject

Biology and Life Sciences, Biochemistry and Molecular Biology

Comments (0)

We encourage comments and feedback from a broad range of readers. See criteria for comments and our Diversity statement.

Leave a public comment
Send a private comment to the author(s)
* All users must log in before leaving a comment
Views 0
Downloads 0
Comments 0


×
Alerts
Notify me about updates to this article or when a peer-reviewed version is published.
We use cookies on our website to ensure you get the best experience.
Read more about our cookies here.