Inverse Folding of RNA Pseudoknot Structures
James Z.M. Gao, Linda Y.M. Li, Christian M. Reidys

TL;DR
This paper introduces 'Inv', an inverse folding algorithm capable of designing RNA sequences that fold into complex pseudoknot structures, extending previous methods limited to secondary structures, and enabling exploration of more intricate RNA configurations.
Contribution
The paper presents 'Inv', a novel inverse folding algorithm that handles 3-noncrossing pseudoknot structures, expanding the scope of RNA design tools beyond secondary structures.
Findings
'Inv' successfully designs RNA sequences for complex pseudoknot structures.
Compared to existing algorithms, 'Inv' considers sets of competing structures.
'Inv' can generate sequences for nonplanar RNA pseudoknots.
Abstract
Background: RNA exhibits a variety of structural configurations. Here we consider a structure to be tantamount to the noncrossing Watson-Crick and \pairGU-base pairings (secondary structure) and additional cross-serial base pairs. These interactions are called pseudoknots and are observed across the whole spectrum of RNA functionalities. In the context of studying natural RNA structures, searching for new ribozymes and designing artificial RNA, it is of interest to find RNA sequences folding into a specific structure and to analyze their induced neutral networks. Since the established inverse folding algorithms, {\tt RNAinverse}, {\tt RNA-SSD} as well as {\tt INFO-RNA} are limited to RNA secondary structures, we present in this paper the inverse folding algorithm {\tt Inv} which can deal with 3-noncrossing, canonical pseudoknot structures. Results: In this paper we present the inverse…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
