most citedRNA-LEGO: Combinatorial Design of Pseudoknot RNA

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

collaborators

6 papers

math.CO200812 cited

Asymptotic analysis of -noncrossing matchings

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

In this paper we study -noncrossing matchings. A -noncrossing matching is a labeled graph with vertex set arranged in increasing order in a horizontal line and…

q-bio.BM2007

-noncrossing RNA structures with arc-length

Emma Y. Jin, Christian M. Reidys

In this paper we enumerate -noncrossing RNA pseudoknot structures with given minimum arc- and stack-length. That is, we study the numbers of RNA pseudoknot structures with arc-l…

q-bio.BM200713 cited

RNA-LEGO: Combinatorial Design of Pseudoknot RNA

Emma Y. Jin, Christian M. Reidys

In this paper we enumerate -noncrossing RNA pseudoknot structures with given minimum stack-length. We show that the numbers of -noncrossing structures without isolated base p…

math.CO20074 cited

On -noncrossing partitions

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

In this paper we prove a duality between -noncrossing partitions over and -noncrossing braids over . This duality is derived directly via (generalize…

math.CO20072 cited

Pseudoknot RNA Structures with Arc-Length

Emma Y. Jin, Christian M. Reidys

In this paper we study -noncrossing RNA structures with arc-length , i.e. RNA molecules in which for any , the nucleotides labeled and () 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 without 1-arcs, i.e. arcs of the form (i,i+1) and in which there exists no k-set of mutually intersecting arc…