Asymptotic Enumeration of RNA Structures with Pseudoknots

Details Asymptotic Enumeration of RNA Structures with Pseudoknots Asymptotic Enumeration of RNA Structures with Pseudoknots

2007-06-21

arxiv.org/abs/0706.3137v1

Biology

Quantitative Biology

Biomolecules

22 pages, 7 figures

Scientific paper

In this paper we present the asymptotic enumeration of RNA structures with pseudoknots. We develop a general framework for the computation of exponential growth rate and the sub exponential factors for $k$-noncrossing RNA structures. Our results are based on the generating function for the number of $k$-noncrossing RNA pseudoknot structures, ${\sf S}_k(n)$, derived in \cite{Reidys:07pseu}, where $k-1$ denotes the maximal size of sets of mutually intersecting bonds. We prove a functional equation for the generating function $\sum_{n\ge 0}{\sf S}_k(n)z^n$ and obtain for $k=2$ and $k=3$ the analytic continuation and singular expansions, respectively. It is implicit in our results that for arbitrary $k$ singular expansions exist and via transfer theorems of analytic combinatorics we obtain asymptotic expression for the coefficients. We explicitly derive the asymptotic expressions for 2- and 3-noncrossing RNA structures. Our main result is the derivation of the formula ${\sf S}_3(n) \sim \frac{10.4724\cdot 4!}{n(n-1)...(n-4)} (\frac{5+\sqrt{21}}{2})^n$.

Affiliated with

Also associated with

No associations

Rating

Asymptotic Enumeration of RNA Structures with Pseudoknots does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Asymptotic Enumeration of RNA Structures with Pseudoknots, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Asymptotic Enumeration of RNA Structures with Pseudoknots will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-192647