A new algorithm for generation of different types of RNA

The structure of RNA is often the key to its function and there is a close relationship between structure and function in biology. In this paper, we present a new algorithm for generating the possible shapes of a single-stranded RNA molecule of length ℓ. We use a bijection between the secondary structure and specific ordered trees. Hence, generating different types of RNA becomes equivalent to the generation of these trees. The generated trees are encoded as integer sequences and are produced in A-order. The time complexity of the presented algorithm is O(ℓ−k) where ℓ is the number of bases and k, the number of pairings. Ranking and unranking algorithms with O(kℓ−k 2) and O(ℓ2+k 2) time complexity are also presented.

[1]  M. C. Er.  Efficient Generation of k-ary Trees in Natural Order (Short Note) , 1992, Comput. J..

[2]  James F. Kors.  A-order generation of k-ary trees with a 4k–4 letter alphabet , 1995 .

[3]  Doron Rotem,et al.  Generation of Binary Trees from Ballot Sequences , 1978, JACM.

[4]  Craig A. Stewart,et al.  Introduction to computational biology , 2005 .

[5]  David Thomas,et al.  The Art in Computer Programming , 2001 .

[6]  Jean Marcel Pallo,et al.  Generating trees with n nodes and m leaves , 1987 .

[7]  Frank Ruskey,et al.  Generating t-ary Trees in A-Order , 1988, Inf. Process. Lett..

[8]  R. Nussinov,et al.  Fast algorithm for predicting the secondary structure of single-stranded RNA. , 1980, Proceedings of the National Academy of Sciences of the United States of America.

[9]  Abbas Nowzari-Dalini,et al.  Parallel Generation of t-Ary Trees in A-order , 2007, Comput. J..

[10]  Frank Ruskey.  Generating t-ary Trees Lexicographically , 1978, SIAM J. Comput..

[11]  David Sankoff,et al.  RNA secondary structures and their prediction , 1984 .

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

[13]  Fatemeh Zare-Mirakabad,et al.  Parallel Generation of the Biological Trees 1 , 2007 .

[14]  Changjie Tang,et al.  Grammar-Oriented Enumeration of Binary Trees , 1997, Comput. J..

[15]  Michael Zuker,et al.  Mfold web server for nucleic acid folding and hybridization prediction , 2003, Nucleic Acids Res..

[16]  Frank Ruskey,et al.  Generating Binary Trees Lexicographically , 1977, SIAM J. Comput..

[17]  M. Zuker,et al.  Structural analysis by energy dot plot of a large mRNA. , 1993, Journal of molecular biology.

[18]  Vincent Vajnovszki,et al.  Generating binary trees in A-order from codewords defined on a four-letter alphabet , 1994 .

[19]  Gary D. Knott,et al.  A numbering system for binary trees , 1977, CACM.

[20]  Vincent Vajnovszki,et al.  Ranking and unranking k-ary trees with a 4k – 4 letter alphabet , 1997 .

[21]  Selim G. Akl,et al.  Generating Regular k-ary Trees Efficiently , 2000, Comput. J..

[22]  Christian N. S. Pedersen,et al.  Fast evaluation of internal loops in RNA secondary structure prediction , 1999, Bioinform..

[23]  Jean Marcel Pallo,et al.  A note on generating binary trees in A-order and B-order , 1985 .

[24]  Wang Jianfang,et al.  GENERATING k-ARY TREES IN LEXICOGRAPHIC ORDER , 1980 .