A new algorithm for generation of different types of RNA

References

• Ahrabian , H. and Nowzari-Dalini , A. 2007 . Parallel generation of t-ary trees in A-order . Comput. J. , 50 : 581 – 588 .
   Google Scholar
• Ahrabian , H. , Nowzari-Dalini , A. , Razaghi , M. and Zare-Mirakabad , F. 2007 . Parallel generation of biological trees . Adv. Model. Optimi. , 9 : 1 – 14 .
   Google Scholar
• Cormen , T. H. , Leiserson , C. E. , Rivest , R. L. and Stein , C. 2001 . Introduction to Algorithms , 2 , Cambridge : MIT Press .
   Google Scholar
• Er , M. C. 1992 . Efficient generation of k-ary trees in natural order . Comput. J. , 35 : 306 – 308 .
   Web of Science ®Google Scholar
• Jacobson , A. B. and Zuker , M. 1993 . Structural analysis by energy dot plot of a large mRNA . J. Mol. Biol. , 233 : 261 – 269 .
   PubMed Web of Science ®Google Scholar
• Knott , G. 1977 . A numbering system for binary trees . Comm. ACM , 20 : 113 – 115 .
   Web of Science ®Google Scholar
• Knuth , D. E. 1997 . “ The Art of Computer Programming ” . In Fundamental Algorithms , 3 , Vol. 1 , Reading : Addison Wesly .
   Google Scholar
• Korsh , J. F. 1995 . A-order generation of k-ary trees with 4k−4 letter alphabet . J. Inform. Optim. Sci. , 16 : 557 – 567 .
   Google Scholar
• Lyngsø , R. B. , Zuker , M. and Pedersen , C. N.S. 1999 . Fast evaluation of internal loops in RNA secondary structure prediction . Bioinformatics , 15 : 440 – 445 .
   PubMedGoogle Scholar
• Nussinov , R. and Jacobson , A. B. 1980 . Fast algorithm for predicting the secondary structure of single-stranded RNA . Proc. Natl Acad. Sci. USA , 77 : 6309 – 6313 .
   PubMed Web of Science ®Google Scholar
• Pallo , J. 1987 . Generating trees with n nodes and m leaves . Intern. J. Comput. Math. , 21 : 133 – 144 .
   Web of Science ®Google Scholar
• Pallo , J. and Racca , R. 1985 . A note on generating binary trees in A-order and B-order . Intern. J. Comput. Math. , 18 : 27 – 39 .
   Web of Science ®Google Scholar
• Roelants van Baronaigien , D. and Ruskey , F. 1988 . Generating t-ary trees in A-order . Inform. Process. Lett. , 27 : 205 – 213 .
   Web of Science ®Google Scholar
• Rotem , D. and Varol , Y. L. 1978 . Generation of binary trees from Ballot sequences . J. ACM , 25 : 396 – 404 .
   Web of Science ®Google Scholar
• Ruskey , F. 1978 . Generating t-ary trees lexicographically . SIAM J. Comput. , 7 : 424 – 439 .
   Web of Science ®Google Scholar
• Vajnovszki , V. and Pallo , J. 1994 . Generating binary trees in A-order from codewords defined on four-letter alphabet . J. Inform. Optim. Sci. , 15 : 345 – 357 .
   Google Scholar
• Vajnovszki , V. and Pallo , J. 1997 . Ranking and unranking of k-ary trees with 4k−4 letter alphabet . J. Inform. Optim. Sci. , 18 : 271 – 279 .
   Google Scholar
• Waterman , M. S. 1995 . Introduction to Computational Biology , New York : CRC Press .
   Google Scholar
• Xiang , L. , Tang , C. and Ushijima , K. 1997 . Grammar-oriented enumeration of binary trees, Comput. J . 40 : 278 – 291 .
   Google Scholar
• Xiang , L. , Ushijima , K. and Akl , S. 2000 . Generating regular k-ary trees efficiently . Comput. J , 43 : 290 – 300 .
   Google Scholar
• Yongjin , Z. and Jianfang , W. 1980 . Generating k-ary trees in lexicographic order . Sci. Sin , 23 : 1219 – 1225 .
   Google Scholar
• Zaks , S. 1980 . Lexicographic generation of ordered trees . Theoret. Comput. Sci. , 10 : 63 – 82 .
   Web of Science ®Google Scholar
• Zuker , M. 2003 . Mfold web server for nucleic acid folding and hybridization prediction . Nucleic Acids Res. , 31 : 3406 – 3415 .
   PubMed Web of Science ®Google Scholar
• Zuker , M. and Sankoff , D. 1984 . RNA secondary structures and their prediction . Bull. Math. Biol. , 46 : 591 – 621 .
   Web of Science ®Google Scholar