Combinatorics Of RNA Structures With Pseudoknots
classification
🧮 math.CO
math.GM
keywords
structuresnoncrossingarcsenumeratepseudoknotpseudoknotsrecursionterm
read the original abstract
In this paper we derive the generating function of RNA structures with pseudoknots. We enumerate all $k$-noncrossing RNA pseudoknot structures categorized by their maximal sets of mutually intersecting arcs. In addition we enumerate pseudoknot structures over circular RNA. For 3-noncrossing RNA structures and RNA secondary structures we present a novel 4-term recursion formula and a 2-term recursion, respectively. Furthermore we enumerate for arbitrary $k$ all $k$-noncrossing, restricted RNA structures i.e. $k$-noncrossing RNA structures without 2-arcs i.e. arcs of the form $(i,i+2)$, for $1\le i\le n-2$.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.