Random words in free groups, non-crossing matchings and RNA secondary structures
Siddhartha Gadgil, Manjunath Krishnapur

TL;DR
This paper investigates the expected fraction of unpaired bases in random RNA sequences and relates it to properties of words in free groups, establishing convergence to a constant and bounds for it.
Contribution
It establishes the convergence of the unpaired base fraction in random RNA structures and connects this to free group word length ratios, extending results to all non-abelian free groups.
Findings
Expected unpaired base fraction converges to a constant between 0 and 1.
The ratio of shortest word length in conjugate generators to standard generators grows linearly.
Results hold for all non-abelian finitely generated free groups.
Abstract
Consider a random word in an alphabet consisting of letters, with the letters viewed either as , , and (i.e., nucleotides in an RNA sequence) or , , and (i.e., generators of the free group and their inverses). We show that the expected fraction of unpaired bases in an optimal RNA secondary structure (with only Watson-Crick bonds and no pseudo-knots) converges to a constant with as . Thus, a positive proportion of the bases of a random RNA string do not form hydrogen bonds. We do not know the exact value of , but we derive upper and lower bounds for it. In terms of free groups, is the ratio of the length of the shortest word representing in the generating set consisting of conjugates of generators…
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 · RNA Research and Splicing · Genomics and Chromatin Dynamics
