中文
相关论文

相关论文: Combinatorics Of RNA Structures With Pseudoknots

200 篇论文

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…

组合数学 · 数学 2020-11-23 Yangyang Zhao

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…

组合数学 · 数学 2007-08-01 Emma Y. Jin , 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$…

组合数学 · 数学 2008-07-04 Hillary S. W. Han , 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…

生物大分子 · 定量生物学 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…

生物大分子 · 定量生物学 2007-12-04 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…

组合数学 · 数学 2008-06-17 Gang Ma , 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…

组合数学 · 数学 2009-09-22 Christian M. Reidys , Rita R. Wang

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…

组合数学 · 数学 2008-07-08 Hillary S. W. Han , Christian M. Reidys

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…

生物大分子 · 定量生物学 2025-12-24 Rayan Ibrahim , Allison H. Moore

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…

组合数学 · 数学 2016-06-23 Thomas J. X. Li , 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…

生物大分子 · 定量生物学 2016-10-19 Graziano Vernizzi , Henri Orland , A. Zee

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…

组合数学 · 数学 2019-10-15 Christian M. Reidys , Rita R. Wang , Y. Y. Zhao

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…

组合数学 · 数学 2009-12-03 Markus E. Nebel , Christian M. Reidys , Rita R. Wang

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…

数据结构与算法 · 计算机科学 2018-03-28 Édouard Bonnet , Paweł Rzążewski , Florian Sikora

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…

组合数学 · 数学 2015-05-13 William Y. C. Chen , Hillary S. W. Han , Christian M. Reidys

Background: RNA exhibits a variety of structural configurations. Here we consider a structure to be tantamount to the noncrossing Watson-Crick and \pairGU-base pairings (secondary structure) and additional cross-serial base pairs. These…

组合数学 · 数学 2010-03-11 James Z. M. Gao , Linda Y. M. Li , Christian M. Reidys

We enumerate the number of RNA contact structures according to their genus, i.e. the topological character of their pseudoknots. By using a recently proposed matrix model formulation for the RNA folding problem, we obtain exact results for…

生物大分子 · 定量生物学 2009-11-10 G. Vernizzi , H. Orland , A. Zee

We present a novel topological classification of RNA secondary structures with pseudoknots. It is based on the topological genus of the circular diagram associated to the RNA base-pair structure. The genus is a positive integer number,…

生物大分子 · 定量生物学 2007-05-23 Michael Bon , Graziano Vernizzi , Henri Orland , A. Zee

RNA-RNA binding is an important phenomenon observed for many classes of non-coding RNAs and plays a crucial role in a number of regulatory processes. Recently several MFE folding algorithms for predicting the joint structure of two…

组合数学 · 数学 2010-06-16 Thomas J. X. Li , Christian M. Reidys

We give recurrence relations for the enumeration of symmetric elements within four classes of arc diagrams corresponding to certain involutions and set partitions whose blocks contain no consecutive integers. These arc diagrams are…

组合数学 · 数学 2023-04-19 Juan B. Gil , Luis E. Lopez
‹ 上一页 1 2 3 10 下一页 ›