Search arXivSearch

arXiv · 2407.06220

Exact enumeration of RNA secondary structures by helices and loops

Abstract

Enumerative studies of RNA secondary structures were initiated four decades ago by Waterman and his coworkers. Since then, RNA secondary structures have been explored according to many different structural characteristics, for instance, helices, components and loops by Hofacker, Schuster and Stadler, orders by Nebel, saturated structures by Clote, the $5^{\prime}$-$3^{\prime}$ end distance by Clote, Ponty and Steyaert, and the rainbow spectrum by Li and Reidys. However, the majority of the contributions are asymptotic results, and it is harder to derive explicit formulas. In this paper, we obtain exact formulas counting RNA secondary structures with a given number of helices as well as a given joint size distribution of helices and loops, while some related asymptotic results due to Hofacker, Schuster and Stadler have been known for about twenty years. Our approach is combinatorial, analyzing a recent bijection between RNA secondary structures and plane trees discovered by the first author and proposing a variation of Chen's bijective approach of counting trees by forests of simple trees.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ricky X. F. Chen, Christian M. Reidys, Michael S. Waterman. 2024-07-05. Exact enumeration of RNA secondary structures by helices and loops. https://arxiv.org/abs/2407.06220

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO