Christian M. Reidys
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Christian M. Reidys has a total of 13 co-authors. Here are the top co-authors by number of shared publications:
Emma Y. Jin
10 shared publicationsJing Qin
5 shared publications- Emma Yu Jin
School of Mathematical Sciences, Xiamen University, Xiamen, China
3 shared publications William Y. C. Chen
3 shared publications- Fenix W. D. Huang
Department of Mathematic and Computer science University of Southern Denmark Campusvej 55 DK-5230 Odense M Denmark
2 shared publications Rita R. Wang
2 shared publications
Latest Publications
- 1 September 2017
- Published by Elsevier in Discrete Mathematics
- Vol. 340 (9) , 2161-2182
A topological framework for signed permutations
- 1 September 2017
- Published by Elsevier in Discrete Mathematics
- Vol. 340 (9) , 2161-2182
A topological framework for signed permutations
- 30 September 2010
- Published by Springer Nature
- p. 187-212
Folding
- 30 September 2010
- Published by Springer Nature
- p. 143-186
Probabilistic Analysis
- 30 September 2010
- Published by Springer Nature
- p. 85-142
Combinatorial analysis
- 30 September 2010
- Published by Springer Nature
- p. 67-83
Tangled diagrams
- 30 September 2010
- Published by Springer Nature
- p. 23-65
Basic concepts
- 30 September 2010
- Published by Springer Nature
- p. 1-21
Introduction
- Open Access
Loops in canonical RNA pseudoknot structures
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 structures allowing for cross-serial interactions, subject to the constraint that there are at most k-1 mutually crossing arcs in the diagram representation of the molecule. We prove central limit theorems by means of studying the corresponding bivariate generating functions. These generating functions are obtained by symbolic inflation of Ik5-shapes.
Open AccessLoops in canonical RNA pseudoknot structures
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 structures allowing for cross-serial interactions, subject to the constraint that there are at most k-1 mutually crossing arcs in the diagram representation of the molecule. We prove central limit theorems by means of studying the corresponding bivariate generating functions. These generating functions are obtained by symbolic inflation of Ik5-shapes.
- 5 November 2009
- Published by Springer Nature in Bulletin of Mathematical Biology
- Vol. 72 (2) , 375-399
Irreducibility in RNA Structures
In this paper, we study irreducibility in RNA structures. By RNA structure, we mean RNA secondary as well as RNA pseudoknot structures as abstract contact structures. We give an analysis contrasting random and minimum free energy (mfe) configurations and secondary versus pseudoknots structures. In the process, we compute various distributions: the numbers of irreducible substructures and their locations and sizes, parameterized in terms of the maximal number of mutually crossing arcs, k−1, and the minimal size of stacks σ. In particular, we analyze the size of the largest irreducible substructure for random and mfe structures, which is the key factor for the folding time of mfe configurations. We show that the largest irreducible substructure is typically unique and contains almost all nucleotides.
- 5 November 2009
- Published by Springer Nature in Bulletin of Mathematical Biology
- Vol. 72 (2) , 375-399
Irreducibility in RNA Structures
In this paper, we study irreducibility in RNA structures. By RNA structure, we mean RNA secondary as well as RNA pseudoknot structures as abstract contact structures. We give an analysis contrasting random and minimum free energy (mfe) configurations and secondary versus pseudoknots structures. In the process, we compute various distributions: the numbers of irreducible substructures and their locations and sizes, parameterized in terms of the maximal number of mutually crossing arcs, k−1, and the minimal size of stacks σ. In particular, we analyze the size of the largest irreducible substructure for random and mfe structures, which is the key factor for the folding time of mfe configurations. We show that the largest irreducible substructure is typically unique and contains almost all nucleotides.