W.Y.C. Chen, J. Qin and C.M. Reidys,
Crossings and nestings in tangled diagrams,
Electron. J. Combin. 15 (2008) #R86.

Cited by


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

  2. S. Burrill and L. Yen, Constructing skolem sequences via generating trees, arXiv:1301.6424.

  3. W.Y.C. Chen, J. Qin and C.M. Reidys, Efficient counting and asymptotics of k-noncrossing tangled diagrams, Electron. J. Combin. 16 (2009) Research Paper 37, 8 pp.

  4. T. Feierl, Asymptotics for the number of walks in a weyl chamber of type B, Random Structures Algorithms 45 (2014) 261-305.

  5. T. Feierl, Random lattice walks in a weyl chamber of type A or B and non-intersecting lattice paths, Ph.D. Thesis, University of Vienna, 2009.

  6. H.S.W. Han and C.M. Reidys, The 5'-3' distance of RNA secondary structures, J. Comput. Biol. 19 (2012) 867-878.

  7. H.S.W. Han and C.M. Reidys, Pseudoknot RNA structures with arc-length 4, J. Comput. Biol. 15 (2008) 1195-1208.

  8. F.W.D. Huang, L.Y.M. Li and C.M. Reidys. Sequence-structure relations of pseudoknot RNA, BMC bioinformatics 10 (2009) 1.

  9. F.W.D. Huang, W.W.J. Peng and C.M. Reidys, Folding 3-noncrossing RNA pseudoknot structures, J. Comput. Biol. 16 (2009) 1549-1575.

  10. F.W.D. Huang, J. Qin, C.M. Reidys and P.F. Stadler, RNA-RNA interaction prediction: partition function and base pair pairing probabilities, arXiv:0903.3283.

  11. F.W.D. Huang and C.M. Reidys, Statistics of canonical RNA pseudoknot structures, J. Comput. Biol. 253 (2008) 570-578.

  12. 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.

  13. E.Y. Jin, J. Qin and C.M. Reidys, On k-noncrossing partitions, arXiv:0710.5014.

  14. E.Y. Jin, J. Qin and C.M. Reidys, Neutral networks of sequence to shape maps, Journal of Theoretical Biology 250 (2008) 484-497.

  15. E.Y. Jin and C.M. Reidys, Combinatorial design of pseudoknot RNA, Adv. in Appl. Math. 42 (2009) 135-151.

  16. E.Y. Jin and C.M. Reidys, On the decomposition of k-noncrossing RNA structures, Adv. in Appl. Math. 44 (2010) 53-70.

  17. Z.C. Lin, Restricted inversion sequences and enhanced 3-noncrossing partitions, European J. Combin. 70 (2018) 202-211.

  18. G. Ma and C.M. Reidys, Canonical RNA pseudoknot structures, J. Comput. Biol. 15 (2008) 1257-1273.

  19. E. Marberg, Crossings and nestings in colored set partitions, Electron. J. Combin. 20(4) (2013) Paper 6, 30 pp.

  20. J. Marsh and S. Schroll, Trees, RNA secondary structures and cluster combinatorics, arXiv:1010.3763.

  21. R. Müller and M.E. Nebel, Combinatorics of RNA secondary structures with base triples, J. Comput. Biol. 22 (2015) 619-648.

  22. J. Qin and C.M. Reidys, A combinatorial framework for RNA tertiary interaction, arXiv:0710.3523.

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

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

  25. C.M. Reidys, Local connectivity of neutral networks, Bull. Math. Biol. 71 (2009) 265-290.

  26. C.M. Reidys, Combinatorial Computational Biology of RNA, Springer, New York, 2011.

  27. S.H.F. Yan, Bijections for inversion sequences, ascent sequences and 3-nonnesting set partitions, Appl. Math. Comput. 325 (2018) 24-30.