Back to Search
Start Over
Combinatorial design of pseudoknot RNA
- Source :
-
Advances in Applied Mathematics . Feb2009, Vol. 42 Issue 2, p135-151. 17p. - Publication Year :
- 2009
-
Abstract
- Abstract: In this paper we enumerate k-noncrossing RNA pseudoknot structures with given minimum stack-length, σ. One main result of the paper is the asymptotic formula for their number: , where is explicitly known. Our results show that the number of k-noncrossing structures without isolated base pairs is significantly smaller than the number of all k-noncrossing structures. In particular we prove that, for large n, the number of 3- and 4-noncrossing RNA structures with stack-length ⩾2 is given by and , respectively. Our results are of importance for prediction algorithms and provide evidence for the existence of neutral networks of RNA pseudoknot structures. [Copyright &y& Elsevier]
- Subjects :
- *NUCLEIC acids
*BIOMOLECULES
*RNA
*RIBOSE
*ALGORITHMS
Subjects
Details
- Language :
- English
- ISSN :
- 01968858
- Volume :
- 42
- Issue :
- 2
- Database :
- Academic Search Index
- Journal :
- Advances in Applied Mathematics
- Publication Type :
- Academic Journal
- Accession number :
- 36342856
- Full Text :
- https://doi.org/10.1016/j.aam.2008.06.003