Related papers: Zigzag Stacks and m-Regular Linear Stacks
Many interesting geometric structures can be described as regular infinitesimal flag structures, which occur as the underlying structures of parabolic geometries. Among these structures we have for instance conformal structures, contact…
The RNA inverse folding problem, a key challenge in RNA design, involves identifying nucleotide sequences that can fold into desired secondary structures, which are critical for ensuring molecular stability and function. The inherent…
A mixed graph $\widetilde{G}$ is obtained by orienting some edges of a graph $G$, where $G$ is the underlying graph of $\widetilde{G}$. Let $r(\widetilde{G})$ be the $H$-rank of $\widetilde{G}$. Denote by $r(G)$, $\kappa(G)$, $m(G)$ and…
Minimal Strong Digraphs (MSDs) can be regarded as a generalization of the concept of tree to directed graphs. Their cyclic structure and some spectral properties have been studied in several articles. In this work, we further study some…
Metrics for indirectly predicting the folding rates of RNA sequences are of interest. In this letter, we introduce a simple metric of RNA structural complexity, which accounts for differences in the energetic contributions of RNA base…
Biomolecular graph analysis has recently gained much attention in the emerging field of geometric deep learning. Here we focus on organizing biomolecular graphs in ways that expose meaningful relations and variations between them. We…
This paper is mainly concerned with applying the theory of M-regularity developed in the previous math.AG/0110003 to the study of linear series given by multiples of ample line bundles on abelian varieties. We define a new invariant of a…
Many computerized methods for RNA-RNA interaction structure prediction have been developed. Recently, $O(N^6)$ time and $O(N^4)$ space dynamic programming algorithms have become available that compute the partition function of RNA-RNA…
Machine learning (ML) is revolutionizing protein structural analysis, including an important subproblem of predicting protein residue contact maps, i.e., which amino-acid residues are in close spatial proximity given the amino-acid sequence…
A protein residue network (PRN) is a network of interacting amino acids within a protein. We describe characteristics of a sparser, highly central and more volatile sub-network of a PRN called the short-cut network (SCN), as a protein folds…
Proteins are the basic building blocks of life. They usually perform functions by folding to a particular structure. Understanding the folding process could help the researchers to understand the functions of proteins and could also help to…
The Gram matrix is a classical object formed from the pairwise inner products of a collection of vectors, with fundamental roles in functional analysis, statistics, combinatorics, and coding theory. In the realm of sequence design,…
Predicting the secondary structure of RNA is a core challenge in computational biology, essential for understanding molecular function and designing novel therapeutics. The field has evolved from foundational but accuracy-limited…
An arc-annotated string is a string of characters, called bases, augmented with a set of pairs, called arcs, each connecting two bases. Given arc-annotated strings $P$ and $Q$ the arc-preserving subsequence problem is to determine if $P$…
Let $P(n,m)$ be a graph chosen uniformly at random from the class of all planar graphs on vertex set $\{1, \ldots, n\}$ with $m=m(n)$ edges. We study the cycle and block structure of $P(n,m)$ when $m\sim n/2$. More precisely, we determine…
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$…
We introduce a method for predicting RNA folding pathways, with an application to the most important RNA tetraloops. The method is based on the idea that ensembles of three-dimensional fragments extracted from high-resolution crystal…
We enumerate possible topologies of pseudoknots in single-stranded RNA molecules. We use a steepest-descent approximation in the large N matrix field theory, and a Feynman diagram formalism to describe the resulting pseudoknot structure.
We present a statistical approach to protein structure by introducing a representation of protein folds based on simple observables defined as frequencies of oriented cycles in contact graphs. Motivated by the idea that these cycles may…
We give a Large Deviation Principle (LDP) with explicit rate function for the distribution of vertex degrees in plane trees, a combinatorial model of RNA secondary structures. We calculate the typical degree distributions based on nearest…