Zigzag Stacks and m-Regular Linear Stacks
William Y.C. Chen, Qiang-Hui Guo, Lisa H. Sun, Jian Wang

TL;DR
This paper introduces a mathematical framework for counting and analyzing m-regular linear stacks, generalizing RNA secondary structures, and provides generating functions, recurrence relations, and asymptotic formulas for their enumeration.
Contribution
It develops a novel approach to enumerate m-regular linear stacks by deriving generating functions and asymptotic formulas, extending previous RNA structure models.
Findings
Derived equations for generating functions of m-regular linear stacks.
Established recurrence relations for counting stacks of size n.
Provided asymptotic formulas for large n.
Abstract
The contact map of a protein fold is a graph that represents the patterns of contacts in the fold. It is known that the contact map can be decomposed into stacks and queues. RNA secondary structures are special stacks in which the degree of each vertex is at most one and each arc has length at least two. Waterman and Smith derived a formula for the number of RNA secondary structures of length with exactly arcs. H\"{o}ner zu Siederdissen et al. developed a folding algorithm for extended RNA secondary structures in which each vertex has maximum degree two. An equation for the generating function of extended RNA secondary structures was obtained by M\"{u}ller and Nebel by using a context-free grammar approach, which leads to an asymptotic formula. In this paper, we consider -regular linear stacks, where each arc has length at least and the degree of each vertex is bounded by…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsRNA and protein synthesis mechanisms · Algorithms and Data Compression · Genomics and Chromatin Dynamics
