Stacks in canonical RNA pseudoknot structures
| dc.creator | Han, Hillary S. W. | |
| dc.creator | Reidys, Christian M. | |
| dc.date | 2008-07-04 | |
| dc.date.accessioned | 2026-07-07T09:48:36Z | |
| dc.date.available | 2026-07-07T09:48:36Z | |
| dc.description | In this paper we study the distribution of stacks in $k$-noncrossing, $τ$-canonical RNA pseudoknot structures ($<k,τ> $-structures). An RNA structure is called $k$-noncrossing if it has no more than $k-1$ mutually crossing arcs and $τ$-canonical if each arc is contained in a stack of length at least $τ$. Based on the ordinary generating function of $<k,τ>$-structures \cite{Reidys:08ma} we derive the bivariate generating function ${\bf T}_{k,τ}(x,u)=\sum_{n \geq 0} \sum_{0\leq t \leq \frac{n}{2}} {\sf T}_{k, τ}^{} (n,t) u^t x^n$, where ${\sf T}_{k,τ}(n,t)$ is the number of $<k,τ>$-structures having exactly $t$ stacks and study its singularities. We show that for a certain parametrization of the variable $u$, ${\bf T}_{k,τ}(x,u)$ has a unique, dominant singularity. The particular shift of this singularity parametrized by $u$ implies a central limit theorem for the distribution of stack-numbers. Our results are of importance for understanding the ``language'' of minimum-free energy RNA pseudoknot structures, generated by computer folding algorithms. | |
| dc.description | 19pages, 4 figures | |
| dc.identifier | https://arxiv.org/abs/0807.0689 | |
| dc.identifier | http://arxiv.org/abs/0807.0689 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/164276 | |
| dc.subject | Combinatorics | |
| dc.subject | General Mathematics | |
| dc.subject | 05A15 | |
| dc.title | Stacks in canonical RNA pseudoknot structures | |
| dc.type | text |