Citations of

William Y. C. Chen, Jing Qin, Christian M. Reidys, Doron Zeilberger, Efficient Counting and Asymptotics of k-Noncrossing Tangled Diagrams, Electron. J. Combin. 16 (2009), #R37.


  1. P. Clote, Asymptotic connectivity for the network of RNA secondary structures, arXiv:1508.03815.

  2. G.P. Egorychev, Method of coefficients: an algebraic characterization and recent applications, Advances in combinatorial mathematics. Springer Berlin Heidelberg, 2009: 1-30.

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

  4. T. Feierl, Asymptotics for Walks in a Weyl chamber of Type B (extended abstract), DMTCS proc. AM, 2010,175–188.
     
  5. T. Feierl, Random lattice walks in a Weyl chamber of type A or B and non-intersecting lattice paths, Ph.D Thesis, Universität Wien, 2009.

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

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

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

  9. E. Marberg, Crossings and Nestings in Colored Set Partitions, Electron. J. Combin. 20(2013) #P6.

  10. J. Marsh and S.Schroll, Trees of relations, cluster and RNA secondary structures, arXiv:1010.3763.

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

  12. C. Reidys, Combinatorial Computational Biology of RNA: Pseudoknots and Neutral Networks. Spinger, 2011.

back to homepage