Pseudoknot RNA Structures with Arc-Length ≥4
- 1 November 2008
- journal article
- research article
- Published by Mary Ann Liebert Inc in Journal of Computational Biology
- Vol. 15 (9) , 1195-1208
- https://doi.org/10.1089/cmb.2008.0051
Abstract
In this article, we study k-noncrossing RNA structures with minimum arc-length 4 and at most k − 1 mutually crossing bonds. Let Tk[4](n) denote the number of k-noncrossing RNA structures with arc-length ≥4 over n vertices. We (a) prove a functional equation for the generating function ∑n≥0 Tk[4](n)zn and (b) derive for 4 ≤ k ≤ 9 the asymptotic formula Tk[4](n) ∼ ck n−((k−1)2+(k−1)/2) γk−n. Furthermore, we explicitly compute the exponential growth rates γk−1 and asymptotic formulas for 4 ≤ k ≤ 9.Keywords
All Related Versions
This publication has 16 references indexed in Scilit:
- Crossings and nestings of matchings and partitionsTransactions of the American Mathematical Society, 2006
- A dynamic programming algorithm for RNA structure prediction including pseudoknots 1 1Edited by I. TinocoJournal of Molecular Biology, 1999
- Combinatorics of RNA secondary structuresDiscrete Applied Mathematics, 1998
- Linear trees and RNA secondary structureDiscrete Applied Mathematics, 1994
- Spaces of RNA Secondary StructuresAdvances in Mathematics, 1993
- RNA pseudoknotsCurrent Opinion in Structural Biology, 1992
- Random Walk in a Weyl ChamberProceedings of the American Mathematical Society, 1992
- A holonomic systems approach to special functions identitiesJournal of Computational and Applied Mathematics, 1990
- Differentiably Finite Power SeriesEuropean Journal of Combinatorics, 1980
- The method of DarbouxJournal of Approximation Theory, 1974