Random k -noncrossing RNA structures

DOI10.1073/pnas.0907269106zbMath1203.92026arXiv0906.5553WikidataQ33564149 ScholiaQ33564149MaRDI QIDQ3069233

Hillary S. W. Han, William Y. C. Chen, Christian M. Reidys

Publication date: 24 January 2011

Published in: Proceedings of the National Academy of Sciences (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0906.5553

Mathematics Subject Classification ID

92C40: Biochemistry, molecular biology

60J99: Markov processes

Related Items

Posets and Spaces of $k$-Noncrossing RNA Structures, Edge crossings in random linear arrangements, Reappraising the distribution of the number of edge crossings of graphs on a sphere, A generating tree approach to \(k\)-nonnesting partitions and permutations, Symmetric circular matchings and RNA folding, On the page number of RNA secondary structures with pseudoknots, Generation of RNA pseudoknot structures with topological genus filtration

Cites Work

• Random walks in Weyl chambers and the decomposition of tensor powers
• RNA structures with pseudo-knots: graph-theoretical, combinatorial, and statistical properties
• Fast uniform generation of regular graphs
• Predicting RNA secondary structures with pseudoknots by MCMC sampling
• Random generation of combinatorial structures from a uniform distribution
• Standard Young tableaux of height 4 and 5
• Differentiably finite power series
• A holonomic systems approach to special functions identities
• A unified setting for sequencing, ranking, and selection algorithms for combinatorial objects
• Combinatorics of RNA structures with pseudoknots
• Coexistence of multiple codes in messenger RNA molecules
• Combinatorics of RNA Hairpins and Cloverleaves
• Algorithms for Loop Matchings
• GFUN
• Boltzmann Samplers for the Random Generation of Combinatorial Structures
• Proportions of Irreducible Diagrams
• On the Vector Representations of Induced Matroids