A combinatorial framework for RNA tertiary interaction

From MaRDI portal



Abstract: In this paper we show how to express RNA tertiary interactions via the concepts of tangled diagrams. Tangled diagrams allow to formulate RNA base triples and pseudoknot-interactions and to control the maximum number of mutually crossing arcs. In particular we study two subsets of tangled diagrams: 3-noncrossing tangled-diagrams with ell vertices of degree two and 2-regular, 3-noncrossing partitions (i.e. without arcs of the form (i,i+1)). Our main result is an asymptotic formula for the number of 2-regular, 3-noncrossing partitions, denoted by p3,2(n), 3-noncrossing partitions over [n]. The asymptotic formula is derived by the analytic theory of singular difference equations due to Birkhoff-Trjitzinsky. Explicitly, we prove the formula p3,2(n+1)simK8nn−7(1+c1/n+c2/n2+c3/n3) where K,ci, i=1,2,3 are constants.














This page was built for publication: A combinatorial framework for RNA tertiary interaction

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6207178)