Related papers: Pseudoknot RNA structures with arc-length $\ge 4$
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…
In this paper we study $k$-noncrossing RNA structures with arc-length $\ge 3$, 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…
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…
In this paper we present the asymptotic enumeration of RNA structures with pseudoknots. We develop a general framework for the computation of exponential growth rate and the sub exponential factors for $k$-noncrossing RNA structures. Our…
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…
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…
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…
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…
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…
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…
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…
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…
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…
An $k$-noncrossing RNA structure can be identified with an $k$-noncrossing diagram over $[n]$, which in turn corresponds to a vacillating tableaux having at most $(k-1)$ rows. In this paper we derive the limit distribution of irreducible…
In this paper we study properties of topological RNA structures, i.e.~RNA contact structures with cross-serial interactions that are filtered by their topological genus. RNA secondary structures within this framework are topological…
In this paper we analyze the length-spectrum of blocks in $\gamma$-structures. $\gamma$-structures are a class of RNA pseudoknot structures that plays a key role in the context of polynomial time RNA folding. A $\gamma$-structure is…
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…
Recently several minimum free energy (MFE) folding algorithms for predicting the joint structure of two interacting RNA molecules have been proposed. Their folding targets are interaction structures, that can be represented as diagrams with…
In this paper we enumerate $k$-noncrossing tangled-diagrams. A tangled-diagram is a labeled graph whose vertices are $1,...,n$ have degree $\le 2$, and are arranged in increasing order in a horizontal line. Its arcs are drawn in the upper…
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…