Combinatorial Properties of RNA Secondary Structures

The secondary structure of an RNA molecule is of great importance and possesses influence, e.g., on the interaction of tRNA molecules with proteins or on the stabilization of mRNA molecules. The classification of secondary structures by means of their order proved useful with respect to numerous applications. In 1978, Waterman, who gave the first precise formal framework for the topic, suggested to determine the number a(n,p) of secondary structures of size n and given order p. Since then, no satisfactory result has been found. Based on an observation due to Viennot et al., we will derive generating functions for the secondary structures of order p from generating functions for binary tree structures with Horton-Strahler number p. These generating functions enable us to compute a precise asymptotic equivalent for a(n,p). Furthermore, we will determine the related number of structures when the number of unpaired bases shows up as an additional parameter. Our approach proves to be general enough to compute the average order of a secondary structure together with all the r-th moments and to enumerate substructures such as hairpins or bulges in dependence on the order of the secondary structures considered.

[1]  Michael S. Waterman,et al.  COMPUTATION OF GENERATING FUNCTIONS FOR BIOLOGICAL MOLECULES , 1980 .

[2]  Philippe Flajolet,et al.  Mellin Transforms and Asymptotics: Harmonic Sums , 1995, Theor. Comput. Sci..

[3]  Michael S. Waterman,et al.  Linear Trees and RNA Secondary Structure , 1994, Discret. Appl. Math..

[4]  Markus E Nebel,et al.  Investigation of the Bernoulli model for RNA secondary structures , 2004, Bulletin of mathematical biology.

[5]  J. Pipas,et al.  Method for predicting RNA secondary structure. , 1975, Proceedings of the National Academy of Sciences of the United States of America.

[6]  Philippe Flajolet,et al.  Analysis of algorithms , 2000, Random Struct. Algorithms.

[7]  Michael S. Waterman,et al.  Combinatorics of RNA Hairpins and Cloverleaves , 1979 .

[8]  Edward A. Bender,et al.  Central and Local Limit Theorems Applied to Asymptotic Enumeration , 1973, J. Comb. Theory A.

[9]  Markus E. Nebel.  A unified approach to the analysis of Horton-Strahler parameters of binary tree structures , 2002, Random Struct. Algorithms.

[10]  Michael S. Waterman,et al.  On some new sequences generalizing the Catalan and Motzkin numbers , 1979, Discret. Math..

[11]  G. Viennot,et al.  Enumeration of RNA Secondary Structures by Complexity , 1985 .

[12]  Donald Ervin Knuth,et al.  The Art of Computer Programming , 1968 .

[13]  Shmuel Zaks,et al.  Lexicographic Generation of Ordered Trees , 1980, Theor. Comput. Sci..

[14]  Michael Drmota.  Asymptotic Distributions and a Multivariate Darboux Method in Enumeration Problems , 1994, J. Comb. Theory, Ser. A.

[15]  M. Waterman,et al.  RNA secondary structure: a complete mathematical analysis , 1978 .

[16]  Xavier Gérard Viennot,et al.  Trees Everywhere , 1990, CAAP.

[17]  Gō Mitiko,et al.  Statistical Mechanics of Biopolymers and Its Application to the Melting Transition of Polynucleotides , 1967 .

[18]  D. Sankoff,et al.  RNA secondary structures and their prediction , 1984 .

[19]  Philippe Flajolet,et al.  Singularity Analysis of Generating Functions , 1990, SIAM J. Discret. Math..

[20]  Peter F. Stadler,et al.  Combinatorics of RNA Secondary Structures , 1998, Discret. Appl. Math..

[21]  A M Lesk.  A combinatorial study of the effects of admitting non-Watson-Crick base pairings and of base composition on the helix-forming potential of polynucleotides of random sequence. , 1974, Journal of theoretical biology.

[22]  Irene A. Stegun,et al.  Handbook of Mathematical Functions. , 1966 .