13 citations · 42 across the 13 of their papers we have counts for
13 papers
Folding 3-noncrossing RNA pseudoknot structures
Fenix W. D. Huang, Wade W. J. Peng, Christian M. Reidys
In this paper we present a selfcontained analysis and description of the novel {\it ab initio} folding algorithm {\sf cross}, which generates the minimum free energy (mfe), 3-noncr…
Stacks in canonical RNA pseudoknot structures
Hillary S. W. Han, Christian M. Reidys
In this paper we study the distribution of stacks in -noncrossing, -canonical RNA pseudoknot structures (-structures). An RNA structure is called -noncrossing if i…
Canonical RNA pseudoknot structures
Gang Ma, Christian M. Reidys
In this paper we study -noncrossing, canonical RNA pseudoknot structures with minimum arc-length . Let denote the number of these structures. We…
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…
Pseudoknot RNA structures with arc-length
Hillary S. W. Han, Christian M. Reidys
In this paper we study -noncrossing RNA structures with minimum arc-length 4 and at most mutually crossing bonds. Let denote the number of -noncr…
Efficient Counting and Asymptotics of -noncrossing tangled-diagrams
William Y. C. Chen, Jing Qin, Christian M. Reidys +1
In this paper we enumerate -noncrossing tangled-diagrams. A tangled-diagram is a labeled graph whose vertices are have degree , and are arranged in increasing o…