E. Y. Jin

most citedRNA-LEGO: Combinatorial Design of Pseudoknot RNA

13 citations · 31 across the 6 of their papers we have counts for

collaborators

Showing math.COShow all

4 papers · 1 filter

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…

math.CO2007★ 4 cited

On $k$ -noncrossing partitions

Emma Y. Jin, Jing Qin, Christian M. Reidys

In this paper we prove a duality between $k$ -noncrossing partitions over $[n] = {1, ..., n}$ and $k$ -noncrossing braids over $[n - 1]$ . This duality is derived directly via (generalize…

math.CO2007★ 2 cited

Pseudoknot RNA Structures with Arc-Length $\geq 3$

Emma Y. Jin, Christian M. Reidys

In this paper we study $k$ -noncrossing RNA structures with arc-length $\geq 3$ , i.e. RNA molecules in which for any $i$ , the nucleotides labeled $i$ and $i + j$ ( $j = 1, 2$ ) cannot form…

math.CO2007

Central and Local Limit Theorems for RNA Structures

Emma Y. Jin, Christian M. Reidys

A k-noncrossing RNA pseudoknot structure is a graph over ${1, ..., n}$ without 1-arcs, i.e. arcs of the form (i,i+1) and in which there exists no k-set of mutually intersecting arc…

Asymptotic analysis of k-noncrossing matchings

On k-noncrossing partitions

Pseudoknot RNA Structures with Arc-Length ≥3

Central and Local Limit Theorems for RNA Structures

Asymptotic analysis of $k$ -noncrossing matchings

On $k$ -noncrossing partitions

Pseudoknot RNA Structures with Arc-Length $\geq 3$