Asymptotics of RNA shapes.

Area of Science:

• Bioinformatics
• Computational Biology
• RNA Structure Analysis

Background:

• RNA secondary structures are classified by RNA shapes, indicating branching complexity.
• Understanding RNA shape complexity is crucial for analyzing RNA sequences.
• Current methods for RNA sequence analysis have limitations in handling complex structures.

Purpose of the Study:

• To derive an exact value for the asymptotic number of RNA shapes.
• To establish a theoretical upper bound for probabilistic RNA shape analysis.
• To demonstrate a novel connection between RNA shapes and combinatorial numbers.

Main Methods:

• Utilizing the relationship between non-ambiguous, context-free grammars and generating functions.
• Applying asymptotic enumeration techniques.
• Proving a one-to-one correspondence between pi-shapes and Motzkin numbers.

Main Results:

• An exact formula for the asymptotic number of RNA shapes was derived.
• A theoretical upper bound for the length of RNA sequences in probabilistic shape analysis was established.
• A bijection between pi-shapes and Motzkin numbers was proven.

Conclusions:

• The derived formula provides a fundamental understanding of RNA shape distribution.
• The findings offer theoretical limits for computational RNA structure analysis.
• The established link to Motzkin numbers opens new avenues for combinatorial research in RNA biology.