English
Related papers

Related papers: Stacks in canonical RNA pseudoknot structures

200 papers

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 $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 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

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…

Biomolecules · Quantitative Biology 2009-02-24 Emma Y. Jin , 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 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 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 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

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 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…

Combinatorics · Mathematics 2016-06-23 Thomas J. X. Li , Christian M. Reidys

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

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…

Combinatorics · Mathematics 2018-06-13 Thomas J. X. Li , Christina S. Burris , Christian M. Reidys

In this paper we derive polynomial time algorithms that generate random $k$-noncrossing matchings and $k$-noncrossing RNA structures with uniform probability. Our approach employs the bijection between $k$-noncrossing matchings and…

Combinatorics · Mathematics 2015-05-13 William Y. C. Chen , Hillary S. W. Han , Christian M. Reidys

We propose a new topological characterization of RNA secondary structures with pseudoknots based on two topological invariants. Starting from the classic arc-representation of RNA secondary structures, we consider a model that couples both…

Biomolecules · Quantitative Biology 2016-10-19 Graziano Vernizzi , Henri Orland , A. Zee

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

Dual graphs have been applied to model RNA secondary structures with pseudoknots, or intertwined base pairs. In previous works, a linear-time algorithm was introduced to partition dual graphs into maximally connected components called…

Biomolecules · Quantitative Biology 2021-09-09 Louis Petingi

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 $\gamma$-structures filtered by topological genus. $\gamma$-structures are a class of RNA pseudoknot structures that plays a key role in the context of polynomial time folding of RNA pseudoknot structures. A…

Combinatorics · Mathematics 2012-02-07 Thomas J. X. Li , Christian M. Reidys

In this paper we study canonical $\gamma$-structures, a class of RNA pseudoknot structures that plays a key role in the context of polynomial time folding of RNA pseudoknot structures. A $\gamma$-structure is composed by specific building…

Combinatorics · Mathematics 2013-09-05 Hillary S. W. Han , Thomas J. X. Li , Christian M. Reidys

An RNA sequence is a word over an alphabet on four elements $\{A,C,G,U\}$ called bases. RNA sequences fold into secondary structures where some bases match one another while others remain unpaired. Pseudoknot-free secondary structures can…

Data Structures and Algorithms · Computer Science 2018-03-28 Édouard Bonnet , Paweł Rzążewski , Florian Sikora
‹ Prev 1 2 3 10 Next ›