English
Related papers

Related papers: Asymptotic Enumeration of RNA Structures with Pseu…

200 papers

In this paper we study $k$-noncrossing RNA structures with minimum arc-length 4 and at most $k-1$ mutually crossing bonds. Let ${\sf T}_{k}^{[4]}(n)$ denote the number of $k$-noncrossing RNA structures with arc-length $\ge 4$ over $n$…

Combinatorics · Mathematics 2008-07-04 Hillary S. W. Han , Christian M. Reidys

In this paper we derive the generating function of RNA structures with pseudoknots. We enumerate all $k$-noncrossing RNA pseudoknot structures categorized by their maximal sets of mutually intersecting arcs. In addition we enumerate…

Combinatorics · Mathematics 2009-09-29 Emma Y. Jin , Jing Qin , Christian M. Reidys

In this paper we study $k$-noncrossing, canonical RNA pseudoknot structures with minimum arc-length $\ge 4$. Let ${\sf T}_{k,\sigma}^{[4]} (n)$ denote the number of these structures. We derive exact enumeration results by computing the…

Combinatorics · Mathematics 2008-06-17 Gang Ma , Christian M. Reidys

In this paper we enumerate $k$-noncrossing RNA pseudoknot structures with given minimum stack-length. We show that the numbers of $k$-noncrossing structures without isolated base pairs are significantly smaller than the number of all…

Biomolecules · Quantitative Biology 2007-12-04 Emma Y. Jin , Christian M. Reidys

In this paper we enumerate $k$-noncrossing RNA pseudoknot structures with given minimum arc- and stack-length. That is, we study the numbers of RNA pseudoknot structures with arc-length $\ge 3$, stack-length $\ge \sigma$ and in which there…

Biomolecules · Quantitative Biology 2007-12-04 Emma Y. Jin , Christian M. Reidys

A k-noncrossing RNA pseudoknot structure is a graph over $\{1,...,n\}$ without 1-arcs, i.e. arcs of the form (i,i+1) and in which there exists no k-set of mutually intersecting arcs. In particular, RNA secondary structures are 2-noncrossing…

Combinatorics · Mathematics 2007-08-01 Emma Y. Jin , Christian M. Reidys

In this paper we study abstract shapes of $k$-noncrossing, $\sigma$-canonical RNA pseudoknot structures. We consider ${\sf lv}_k^{\sf 1}$- and ${\sf lv}_k^{\sf 5}$-shapes, which represent a generalization of the abstract $\pi'$- and…

Combinatorics · Mathematics 2009-09-22 Christian M. Reidys , Rita R. Wang

In this paper we compute the generating function of modular, $k$-noncrossing diagrams. A $k$-noncrossing diagram is called modular if it does not contains any isolated arcs and any arc has length at least four. Modular diagrams represent…

Combinatorics · Mathematics 2019-10-15 Christian M. Reidys , Rita R. Wang , Y. Y. Zhao

RNA molecules are known to form complex secondary structures including pseudoknots. A systematic framework for the enumeration, classification and prediction of secondary structures is critical to determine the biological significance of…

Biomolecules · Quantitative Biology 2025-12-24 Rayan Ibrahim , Allison H. Moore

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…

Combinatorics · Mathematics 2007-12-10 Jing Qin , Christian M. Reidys

In this paper we compute the limit distributions of the numbers of hairpin-loops, interior-loops and bulges in k-noncrossing RNA structures. The latter are coarse grained RNA structures allowing for cross-serial interactions, subject to the…

Combinatorics · Mathematics 2009-12-03 Markus E. Nebel , Christian M. Reidys , Rita R. Wang

We propose a new method for obtaining complete asymptotic expansions in a systematic manner, which is suitable for counting sequences of various graph families in dense regime. The core idea is to encode the two-dimensional array of…

Combinatorics · Mathematics 2024-12-02 Sergey Dovgal , Khaydar Nurligareev

It is derived the explicit asymptotic expression in $n$ for the coefficient $c_n$ of the generating function for multiplicative structures with sub exponential rate of growth of $c_n,$ as $n\to\infty$.

Combinatorics · Mathematics 2017-05-04 Boris Granovsky

In this paper we study the distribution of stacks in $k$-noncrossing, $\tau$-canonical RNA pseudoknot structures ($<k,\tau> $-structures). An RNA structure is called $k$-noncrossing if it has no more than $k-1$ mutually crossing arcs and…

Combinatorics · Mathematics 2008-07-08 Hillary S. W. Han , Christian M. Reidys

There exists many complicated $k$-noncrossing pseudoknot RNA structures in nature based on some special conditions. The special characteristic of RNA structures gives us great challenges in researching the enumeration, prediction and the…

Combinatorics · Mathematics 2020-11-23 Yangyang Zhao

In this paper we study $k$-noncrossing matchings. A $k$-noncrossing matching is a labeled graph with vertex set $\{1,...,2n\}$ arranged in increasing order in a horizontal line and vertex-degree 1. The $n$ arcs are drawn in the upper…

Combinatorics · Mathematics 2008-03-07 Emma Y. Jin , Christian M. Reidys , Rita R. Wang

A quantitative characterization of the relationship between molecular sequence and structure is essential to improve our understanding of how function emerges. This particular genotype-phenotype map has been often studied in the context of…

Populations and Evolution · Quantitative Biology 2017-04-20 José A. Cuesta , Susanna Manrubia

Ab initio RNA secondary structure predictions have long dismissed helices interior to loops, so-called pseudoknots, despite their structural importance. Here, we report that many pseudoknots can be predicted through long time scales RNA…

Biological Physics · Physics 2009-11-10 A. Xayaphoummine , T. Bucher , F. Thalmann , H. Isambert

In this paper we present a selfcontained analysis and description of the novel {\it ab initio} folding algorithm {\sf cross}, which generates the minimum free energy (mfe), 3-noncrossing, $\sigma$-canonical RNA structure. Here an RNA…

Combinatorics · Mathematics 2008-09-30 Fenix W. D. Huang , Wade W. J. Peng , Christian M. Reidys

We conclude our work [arXiv:2403.07628, arXiv:2503.12644] on asymptotic expansions at the soft edge for the classical $n$-dimensional Gaussian and Laguerre ensembles, now studying the gap-probability generating functions. We show that the…

Probability · Mathematics 2026-05-18 Folkmar Bornemann
‹ Prev 1 2 3 10 Next ›