English

Stacks in canonical RNA pseudoknot structures

Combinatorics 2008-07-08 v1 General Mathematics

Abstract

In this paper we study the distribution of stacks in kk-noncrossing, τ\tau-canonical RNA pseudoknot structures (<k,τ><k,\tau> -structures). An RNA structure is called kk-noncrossing if it has no more than k1k-1 mutually crossing arcs and τ\tau-canonical if each arc is contained in a stack of length at least τ\tau. Based on the ordinary generating function of <k,τ><k,\tau>-structures \cite{Reidys:08ma} we derive the bivariate generating function Tk,τ(x,u)=n00tn2Tk,τ(n,t)utxn{\bf T}_{k,\tau}(x,u)=\sum_{n \geq 0} \sum_{0\leq t \leq \frac{n}{2}} {\sf T}_{k, \tau}^{} (n,t) u^t x^n, where Tk,τ(n,t){\sf T}_{k,\tau}(n,t) is the number of <k,τ><k,\tau>-structures having exactly tt stacks and study its singularities. We show that for a certain parametrization of the variable uu, Tk,τ(x,u){\bf T}_{k,\tau}(x,u) has a unique, dominant singularity. The particular shift of this singularity parametrized by uu 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.

Cite

@article{arxiv.0807.0689,
  title  = {Stacks in canonical RNA pseudoknot structures},
  author = {Hillary S. W. Han and Christian M. Reidys},
  journal= {arXiv preprint arXiv:0807.0689},
  year   = {2008}
}

Comments

19pages, 4 figures

R2 v1 2026-06-21T10:57:25.872Z