Random k -noncrossing RNA structures

DOI10.1073/pnas.0907269106zbMath1203.92026arXiv0906.5553OpenAlexW1999118179WikidataQ33564149 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

Biochemistry, molecular biology (92C40) Markov processes (60J99)

Related Items (7)

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

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

This page was built for publication: Random k -noncrossing RNA structures