Rita R. Wang

activity

20082010

k

-noncrossing matchings

12 citations · 19 across the 5 of their papers we have counts for

collaborators

Showing math.COShow all

5 papers · 1 filter

math.CO2010★ 6 cited

Linear chord diagrams on two intervals

Jørgen E. Andersen, Robert C. Penner, Christian M. Reidys +1

Consider all possible ways of attaching disjoint chords to two ordered and oriented disjoint intervals so as to produce a connected graph. Taking the intervals to lie in the real a…

math.CO2010

Modular, $k$ -noncrossing diagrams

Christian M. Reidys, Rita R. Wang, Y. Y. Zhao

In this paper we compute the generating function of modular, $k$ -noncrossing diagrams. A $k$ -noncrossing diagram is called modular if it does not contains any isolated arcs and any…

math.CO2009

Loops in canonical RNA pseudoknot structures

Markus E. Nebel, Christian M. Reidys, Rita R. Wang

In this paper we compute the limit distributions of the numbers of hairpin-loops, interior-loops and bulges in k-noncrossing RNA structures. The latter are coarse grained RNA struc…

math.CO2009★ 1 cited

Shapes of RNA pseudoknot structures

Christian M. Reidys, Rita R. Wang

In this paper we study abstract shapes of $k$ -noncrossing, $σ$ -canonical RNA pseudoknot structures. We consider $lv_{k}^{1}$ - and $lv_{k}^{5}$ -shapes, which represe…

math.CO2008★ 12 cited

Asymptotic analysis of $k$ -noncrossing matchings

Emma Y. Jin, Christian M. Reidys, Rita R. Wang

In this paper we study $k$ -noncrossing matchings. A $k$ -noncrossing matching is a labeled graph with vertex set ${1, ..., 2 n}$ arranged in increasing order in a horizontal line and…