RNA secondary structures with given motif specification: combinatorics and algorithms
From MaRDI portal
Publication:2687721
DOI10.1007/s11538-023-01128-5OpenAlexW4320485804MaRDI QIDQ2687721
Ricky X. F. Chen, Christian M. Reidys, Michael S. Waterman
Publication date: 7 March 2023
Published in: Bulletin of Mathematical Biology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11538-023-01128-5
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Expected distance between terminal nucleotides of RNA secondary structures
- Asymptotic distribution of motifs in a stochastic context-free grammar model of RNA folding
- RNA secondary structures and their prediction
- Efficient sampling of RNA secondary structures from the Boltzmann ensemble of low-energy
- On some new sequences generalizing the Catalan and Motzkin numbers
- Combinatorics of RNA secondary structures
- Linear trees and RNA secondary structure
- On trees and noncrossing partitions
- Enumerative aspects of secondary structures
- Noncrossing partitions
- On Finding All Suboptimal Foldings of an RNA Molecule
- A general bijective algorithm for trees.
- Combinatorics of RNA Hairpins and Cloverleaves
- Boltzmann Samplers for the Random Generation of Combinatorial Structures