W.Y.C. Chen, H.S.W. Han and C.M. Reidys,
Random k-noncrossing RNA Structures,
Proc. Natl. Acad. Sci. USA 106(52) (2009) 22061-22066.

Cited by

  1. S. Burrill, S. Elizalde, M. Mishna and L. Yen, Generating trees for partitions and permutations with no k-nestings, In: DMTCS Proceedings, 24th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2012), 2012.

  2. S. Burrill, S. Elizalde, M. Mishna and L. Yen, A generating tree approach to k-nonnesting partitions and permutations, Ann. Comb. 20(3) (2016) 453-485.

  3. C.S. Burris, The framework of analytic combinatorics applied to RNA structures, Master Thesis, the Virginia Polytechnic Institute and State University, 2018.

  4. J. Chiu and Y. P. Chen, Conformational features of topologically classified RNA secondary structures, PLOS ONE 7 (2012) e39907, 14 pp.

  5. P. Clote, S. Dobrev, I. Dotu, E. Kranakis, D. Krizanc and J. Urrutia, On the page number of RNA secondary structures with pseudoknots, J. Math. Biol. 65 (2012) 1337-1357.

  6. R. Ferrer-i-Cancho, A stronger null hypothesis for crossing dependencies, Europhys. Lett. EPL, 108 (2014).

  7. R. Ferrer-i-Cancho, Non-crossing dependencies: Least effort, not grammar, In: Towards a Theoretical Framework for Analyzing Complex Linguistic Networks Part of the series Understanding Complex Systems, 203-234, Springer-Verlag Berlin Heidelberg, 2016.

  8. J.Z.M. Gao, L.Y.M. Li and C.M. Reidys, Inverse folding of RNA pseudoknot structures, Algorithms. Mol. Biol. (2010) 5:27, 19 pp.

  9. C. Gómez-Rodríguez and R. Ferrer-i-Cancho, Scarcity of crossing dependencies: A direct outcome of a specific constraint? Physical Review E. 96(6) (2017) 062304, 12 pp.

  10. I.L. Hofacker, C.M. Reidys and P.F. Stadler, Symmetric circular matchings and RNA folding, Discret. Math. 312 (2012) 100-112.

  11. F.W.D. Huang and C.M. Reidys, On the uniform generation of modular diagrams, Electron. J. Combin. 17 (2010) Research Paper 175, 16 pp.

  12. F.W.D. Huang, M.E. Nebel and C.M. Reidys, Generation of RNA pseudoknot structures with topological genus filtration, Math. Biosci. 245 (2013) 216-225.

  13. M. Mishna and L. Yen, Set partitions with no m-nesting, In: Advances in Combinatorics, 249-258, Springer, Heidelberg, 2013.

  14. M.E. Nebel, C.M. Reidys and R.R. Wang, Loops in canonical RNA pseudoknot structures, J. Comput. Biol. 18(12) (2011) 1793-1806.

  15. J. Post, Combinatorics of arc diagrams, Ferrers fillings, Young tableaux and lattice paths, Master Thesis, B.Sc. Portland State University, 2001.

  16. J. Qin and C.M. Reidys, Random 3-noncrossing partitions, arXiv:0910.2608.

  17. J. Qin and C.M. Reidys, Random k-noncrossing partitions, arXiv:0911.2960.

  18. C. Reidys, Combinatorial Computational Biology of RNA, Springer, 2010.

  19. 刘国栋, 王振佳, 刘丙强, RNA 折叠中的最大公共嵌套子图, 山东大学学报 47(12) (2012) 57-63.