An Algorithm for RNA Pseudoknots
Abstract
We further develop the large N formalism presented by some of us in earlier works in order to recursively calculate the partition function of a singly pseudoknotted RNA. We demonstrate that this calculation takes time proportional to the sixth power of the length of the RNA. The algorithm itself is presented in a self-contained form for the convenience of readers interested in implementing it.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.