Related papers: RNA-LEGO: Combinatorial Design of Pseudoknot RNA
In this paper, we study the combinatorial set of RNA secondary structures of length $n$ with $m$ base-pairs. For a compact representation, we encode an RNA secondary structure by the corresponding Motzkin word. For this combinatorial set,…
The topological filtration of interacting RNA complexes is studied and the role is analyzed of certain diagrams called irreducible shadows, which form suitable building blocks for more general structures. We prove that for two interacting…
Computational prediction of RNA structures is an important problem in computational structural biology. Studies of RNA structure formation often assume that the process starts from a fully synthesized sequence. Experimental evidence,…
For a set $P$ of $n$ points in the plane in general position, a non-crossing spanning tree is a spanning tree of the points where every edge is a straight-line segment between a pair of points and no two edges intersect except at a common…
We consider the Combinatorial RNA Design problem, a minimal instance of RNA design where one must produce an RNA sequence that adopts a given secondary structure as its minimal free-energy structure. We consider two free-energy models where…
Accurate prediction of RNA secondary structure underpins transcriptome annotation, mechanistic analysis of non-coding RNAs, and RNA therapeutic design. Recent gains from deep learning and RNA foundation models are difficult to interpret…
Formation of base pairs between the nucleotides of an RNA sequence gives rise to a complex and often highly branched RNA structure. While numerous studies have demonstrated the functional importance of the high degree of RNA branching --…
In this work, we investigate a challenging problem, which has been considered to be an important criterion in designing codewords for DNA computing purposes, namely secondary structure avoidance in single-stranded DNA molecules. In short,…
Knots are commonly found in molecular chains such as DNA and proteins, and they have been considered to be useful models for structural analysis of these molecules. One interested quantity is the minimum number of monomers necessary to…
The ongoing effort to detect and characterize physical entanglement in biopolymers has so far established that knots are present in many globular proteins and also abound in viral DNA packaged inside bacteriophages. RNA molecules, on the…
The primary structure of a ribonucleic acid (RNA) molecule can be represented as a sequence of nucleotides (bases) over the alphabet {A, C, G, U}. The secondary or tertiary structure of an RNA is a set of base pairs which form bonds between…
Two subsets $A$ and $B$ of a ground set $X$ are \emph{crossing} if none of the four sets $A\setminus B,B\setminus A,A\cap B, X\setminus (A\cup B)$ are empty. Almost fifty years ago, Karzanov and Lomonosov conjectured that every family of…
A set partition is said to be $(k,d)$-noncrossing if it avoids the pattern $12... k12... d$. We find an explicit formula for the ordinary generating function of the number of $(k,d)$-noncrossing partitions of $\{1,2,...,n\}$ when $d=1,2$.
The Kinetoplast DNA (kDNA) is a two-dimensional Olympic-ring-like network of mutually linked 2.5 kb-long DNA minicircles found in certain parasites called Trypanosomes. Understanding the self-assembly and replication of this structure are…
Given an RNA sequence a, consider the network G = (V;E), where the set V of nodes consists of all secondary structures of a, and whose edge set E consists of all edges connecting two secondary structures whose base pair distance is 1.…
In this paper, we propose an end-to-end deep learning model, called E2Efold, for RNA secondary structure prediction which can effectively take into account the inherent constraints in the problem. The key idea of E2Efold is to directly…
We study genetic networks that produce many species of non-coding RNA molecules that are present at a moderate density, as typically exists in the cell. The associations of the many species of these RNA are modeled physically, taking into…
We present a general setting for structure-sequence comparison in a large class of RNA structures that unifies and generalizes a number of recent works on specific families on structures. Our approach is based on tree decomposition of…
We show the expected order of RNA saturated secondary structures of size $n$ is $\log_4n(1+O(\frac{\log_2n}{n}))$, if we select the saturated secondary structure uniformly at random. Furthermore, the order of saturated secondary structures…
Computational RNA design tasks are often posed as inverse problems, where sequences are designed based on adopting a single desired secondary structure without considering 3D conformational diversity. We introduce gRNAde, a geometric RNA…