General combinatorics of RNA secondary structure

Area of Science:

• Bioinformatics
• Computational Biology
• Structural Biology

Background:

• RNA secondary structures are crucial for gene regulation and function.
• Understanding the combinatorial possibilities of RNA structures is fundamental.
• Previous work has focused on specific structural constraints, but a general computation is needed.

Purpose of the Study:

• To compute the total number of possible RNA secondary structures.
• To incorporate constraints on minimal hairpin loop length (m) and minimal stack length (l).
• To derive asymptotic formulas for these counts.

Main Methods:

• Utilizing recurrence relations derived from decomposition properties of RNA secondary structures.
• Applying combinatorial analysis to enumerate structures with specified loop and stack length constraints.
• Deriving asymptotic approximations for large RNA sequences.

Main Results:

• A formula for the total number of RNA secondary structures with minimal hairpin loop length m and minimal stack length l.
• Asymptotic behavior of these counts is determined.
• The derived recurrence relations provide a framework for further structural analysis.

Conclusions:

• The study provides a comprehensive method for counting RNA secondary structures under specific constraints.
• The derived asymptotic formulas offer insights into the statistical properties of RNA folding.
• This work contributes to a deeper understanding of RNA structural diversity and its implications.