Random k-noncrossing RNA structures

Proceedings of the National Academy of Sciences of the United States of America

Volumn 106, Issue 52, 2009, Pages 22061-22066

  Chen, William Y C ^a   Han, Hillary S W ^a   Reidys, Christian M ^a  

^a NANKAI UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

AB INITIO CALCULATION; ALGORITHM; ARTICLE; ENERGY; PRIORITY JOURNAL; PROBABILITY; RNA STRUCTURE; SAMPLING; STATISTICS;

ALGORITHMS; MARKOV CHAINS; MODELS, MOLECULAR; NUCLEIC ACID CONFORMATION; RNA; STOCHASTIC PROCESSES; THERMODYNAMICS;

EID: 76049085900     PISSN: 00278424     EISSN: 10916490     Source Type: Journal    
DOI: 10.1073/pnas.0907269106     Document Type: Article

References (38)

1. Westhof E, Jaeger L, (1992) RNA pseudoknots. Curr Opin Struct Biol 2:327-333.
2. Loria A, Pan T (1996) Domain structure of the ribozyme from eubacterial ribonuclease P. RNA 2:551-563.
3. Staple DW, Butcher SE (2005) Pseudoknots: RNA structures with diverse functions. PLoS Biol 3:956-959.
4. Konings DAM, Gutell RR (1995) A comparison of thermodynamic foldings with comparatively derived structures of 16S and 16S-like rRNAs. RNA 1:559-574.
5. Tuerk C, MacDougal S, Gold L (1992) RNA pseudoknots that inhibit human immunodeficiency virus type 1 reverse transcriptase. Proc Natl Acad Sci USA 89:6988-6992.
6. Chamorro M, Parkin N, Varmus HE (1991) An RNA pseudoknot and an optimal heptameric shift site are required for highly efficient ribosomal frameshifting on a retroviral messenger RNA J. Proc Natl Acad Sci USA 89:713-717.
7. Rivas E, Eddy SR (1999) A dynamic programming algorithm for RNA structure prediction including pseudoknots. J Mol Biol 285:2053-2068.
8. Lyngso RB, Pedersen CNS (2000) RNA pseudoknot prediction in energy-based models. J Comput Biol 7:409-427.
9. Waterman MS (1979) Combinatorics of RNA hairpins and cloverleafs. Stud Appl Math 60:91-96.
10. Nussinov R, Pieczenik G, Griggs JR, Kleitman DJ (1978) Algorithms for loop matchings. SIAM J Appl Math 35:68-82.
11. Kleitman D (1970) Proportions of irreducible diagrams. Stud Appl Math 49:297-299.
12. Hofacker IL (2003) Vienna RNA secondary structure server. Nucleic Acids Res 31:3429-3431.
13. Duchon P, Flajolet P, Louchard G, Schaeffer G (2004) Boltzmann samplers for the random generation of combinatorial structures. Combin Probab Comput 13:577-625.
14. Jin EY, Qin J, Reidys CM (2008) Combinatorics of RNA structures with pseudoknots. Bull Math Biol 70:45-67.
15. Jin EY, Reidys CM (2008) Combinatorial design of pseudoknot RNA. Adv Appl Math 42:135-151.
16. Haslinger C, Stadler PF (1999) RNA structures with pseudo-knots: Graph-theoretical, combinatorial, and statistical properties. Bull Math Bio 61:437-467.
17. Jin EY, Reidys CM (2007) Central and local limit theorems for RNA structures. J Theor Biol 250:547-559.
18. Zito M, Pu I, Alnos M, Gibbons A (1996) RCN algorithms for the uniform generation of combinatorial structures. Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms. (Soc Ind Appl Math, Philadelphia) 429-437.
19. Jerrum MR, Valiant LG, Vazirant VV (1986) Random generation of combinatorial structures from a uniform distribution. Theor Comput Sci 43:169-188.
20. Jerrum M, Sinclair A (1990) Fast uniform generation of regular graphs. Theor Comput Sci 73:91-100.
21. Aldous D (1982) Random walks on finite groups and rapidly mixing Markov chains. Séminaire de Probabilités XVII. Lecture Notes in Mathematics (Springer, Berlin) Vol. 986, pp 243-297.
22. Wilf HS (1977) A unified setting for sequencing, ranking, and selection algorithms for combinatorial objects, Adv Math 24:281-291.
23. Nijenhuis A, Wilf HS (1978) Combinatorial Algorithms (Academic, New York).
24. Stanley RP (1980) Differentiably finite power series. Eur J Combin 1:175-188.
25. Stanley RP (1996) Enumerative Combinatorics. (Cambridge Univ Press, Cambridge, UK), Vol 1.
26. Chen WYC, Deng EYP, Du RRX, Stanley RP, Yan CH (2007) Crossings and nestings of matchings and partitions. Trans Amer Math Soc 359:1555-1575.
27. Renault M (2008) Lost (and found) in translation: André's actual method and its application to the generalized Ballot problem. Am Math Monthly 115: 358-363.
28. Gessel IM, Zeilberger D (1992) Random walk in a Weyl chamber. Proc Am Math Soc 115:27-31.
29. Lindström B (1973) On the vector representation of induced matroids. Bull London Math Soc 5:85-90.
30. Grabiner DJ, Magyar P (1993) Random walks inWeyl chambers and the decomposition of Tensor Powers. J Algebr Combin 2:239-260.
31. Zeilberger D (1990) A holonomic systems approach to special functions identities. J Comput Appl Math 32:321-368.
32. Salvy B, Zimmerman P (1994) GFUN: A Maple package for the manipulation of generating and holonomic functions in one variable. ACM Trans Math Software 20:163-177.
33. Gessel IM, Viennot XG (1989) Determinants, paths, and plane partitions, preprint.
34. Gouyou-Beauschamps D (1989) Standard Young tableaux of height 4 and 5. Eur J Combin 10:69-82.
35. Witwer C, Hofacker IL, Stadler PF (2004) Prediction of consensus RNA secondary structures including pseudoknots. IEEE/ACM Trans Comput Biol Bioinform 1:66-77.
36. Knudsen B, Hein J (1999) RNA secondary structure prediction using stochastic context-free grammars and evolutionary history. Bioinformatics 15:446-454.
37. Metzler D, Nebel ME (2008) Predicting RNA secondary structures with pseudoknots by MCMC sampling. J Math Biol 56:161-181.
38. Laube U, Nebel ME (2009) Maximum likelihood analysis of algorithms and data structures. Theor Comp Sci, doi: 10.1016/j.tcs.2009.09.025.