Citations of

William Y.C. Chen, Jing Qin, and Christian M. Reidys, Crossings and nestings of tangled diagrams, Electron. J. Combin. 15 (2008) #R86.


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

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

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

  4. W.Y.C. Chen, J. Qin and C.M. Reidys, Efficient counting and asymptotics of k-noncrossing tangled diagrams, Electron. J. Combin. 16 (2009) 1.

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

  6. T. Feierl, Random lattice walks in a weyl chamber of type A or B and non-intersecting lattice paths, 2009.

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

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

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

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

  11. F.W.D. Huang, J. Qin, C.M. Reidys and P.F. Stadler, Partition function and base pairing probabilities for RNA–RNA interaction prediction, Bioinformatics, 25(2009) 2646-2654.

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

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

  14. F.W.D. Huang and C.M. Reidys, On the uniform generation of modular diagrams, Electron. J. Combin. 17(2010) R175.

  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. E.Y. Jin and C.M. Reidys, RNA pseudoknot structures with arc-length 3 and stack-length , Discrete Appl. Math. 158(2010) 25-36.

  18. E.Y. Jin and C.M. Reidys, RNA-Lego: combinatorial design of pseudoknot RNA, arXiv:0711.1405.

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

  20. E.Y. Jin, J. Qin and M.R. Christian, On 2-regular, k-noncrossing partitions, arXiv:0710.5014.

  21. E.Y. Jin, J. Qin and C.M. Reidys, Neutral networks of sequence to shape maps, J. Theoret. Biol. 250 (2008) 484-497.

  22. E. Marberg, Crossings and nestings in colored set partitions, arXiv:1203.5738.

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

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

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

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

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

  28. C. Reidys, Basic concepts, combinatorial computational biology of RNA. Springer New York, 2011: 23-65.

  29. C. Reidys, Tangled diagrams, combinatorial computational biology of RNA. Springer New York, 2011: 67-83.

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

back to homepage