RNA-LEGO: Combinatorial Design of Pseudoknot RNA

Biology – Quantitative Biology – Biomolecules

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

21 pages and 8 figures

Scientific paper

In this paper we enumerate $k$-noncrossing RNA pseudoknot structures with given minimum stack-length. We show that the numbers of $k$-noncrossing structures without isolated base pairs are significantly smaller than the number of all $k$-noncrossing structures. In particular we prove that the number of 3- and 4-noncrossing RNA structures with stack-length $\ge 2$ is for large $n$ given by $311.2470 \frac{4!}{n(n-1)...(n-4)}2.5881^n$ and $1.217\cdot 10^{7} n^{-{21/2}} 3.0382^n$, respectively. We furthermore show that for $k$-noncrossing RNA structures the drop in exponential growth rates between the number of all structures and the number of all structures with stack-size $\ge 2$ increases significantly. Our results are of importance for prediction algorithms for pseudoknot-RNA and provide evidence that there exist neutral networks of RNA pseudoknot structures.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

RNA-LEGO: Combinatorial Design of Pseudoknot RNA does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with RNA-LEGO: Combinatorial Design of Pseudoknot RNA, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and RNA-LEGO: Combinatorial Design of Pseudoknot RNA will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-702119

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.