RNA pseudoknot structures with arc-length 3 and stack-length

DOI10.1016/J.DAM.2009.08.004MaRDI QIDQ968109zbMATH OpenOpenAlexFDO

Authors Christian M. Reidys, Emma Yu Jin

Publication date 5 May 2010

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0708.3134

zbMATH Keywords

generating functionenumerationRNA secondary structurepseudoknot

Mathematics Subject Classification ID

Applications of graph theory (05C90) Biochemistry, molecular biology (92C40)

Abstract: In this paper we study $k$-noncrossing RNA structures with arc-length $ge3$, i.e. RNA molecules in which for any $i$, the nucleotides labeled $i$ and $i+j$ ($j=1,2$) cannot form a bond and in which there are at most $k-1$ mutually crossing arcs. Let ${sfS}_{k,3}(n)$ denote their number. Based on a novel functional equation for the generating function $su{m}_{nge0}{sfS}_{k,3}(n)z^n$, we derive for arbitrary $kge3$ exponential growth factors and for $k=3$ the subexponential factor. Our main result is the derivation of the formula ${sfS}_{3,3}(n)simfrac6.11170cdot4!n(n-1)\mathrm{...}(n-4)4.54920^n$.

Recommendations

• Combinatorial design of pseudoknot RNA
• Statistics of canonical RNA pseudoknot structures
• Stacks in canonical RNA pseudoknot structures
• Asymptotic enumeration of RNA structures with pseudoknots
• Combinatorics of RNA structures with pseudoknots

Cites work

• scientific article; zbMATH DE number 3675903 (Why is no real title available?)
• scientific article; zbMATH DE number 863491 (Why is no real title available?)
• AN EXAMPLE IN THE THEORY OF THE SPECTRUM OF A FUNCTION
• Asymptotic enumeration of RNA structures with pseudoknots
• Combinatorial design of pseudoknot RNA
• Combinatorics of RNA Hairpins and Cloverleaves
• Combinatorics of RNA structures with pseudoknots
• Computation of Generating Functions for Biological Molecules
• Crossings and nestings of matchings and partitions
• Differentiably finite power series
• RNA structures with pseudo-knots: graph-theoretical, combinatorial, and statistical properties
• Random walks in Weyl chambers and the decomposition of tensor powers
• Rapid dynamic programming algorithms for RNA secondary structure
• The Cauchy identity for \(Sp(2n)\)

Cited in

(16)

• On the decomposition of \(k\)-noncrossing RNA structures
• A new algorithm for aligning nested arc-annotated sequences under arbitrary weight schemes
• On the page number of RNA secondary structures with pseudoknots
• Asymptotic enumeration of RNA structures with pseudoknots
• Statistics of canonical RNA pseudoknot structures
• Counting RNA pseudoknotted structures (extended abstract)
• Random \(k\)-noncrossing RNA structures
• Stacks in canonical RNA pseudoknot structures
• Prediction and statistics of pseudoknots in RNA structures using exactly clustered stochastic simulations
• Central and local limit theorems for RNA structures
• An integer linear programming problem for RNA structures
• Properties of RNA secondary structure matching models
• The block spectrum of RNA pseudoknot structures
• Irreducibility in RNA structures
• RNA structures with pseudo-knots: graph-theoretical, combinatorial, and statistical properties
• Enumerating RNA structures, including pseudoknots of any topology

This page was built for publication: RNA pseudoknot structures with arc-length \(\geq 3\) and stack-length \(\geq \sigma \)

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