arXiv · cond-mat/0310505
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.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
M. Pillsbury, J. A. Taylor, H. Orland, A. Zee. 2005-09-02. An Algorithm for RNA Pseudoknots. https://arxiv.org/abs/cond-mat/0310505
Cite the original work for its findings. Save a collection to share your selection of sources.