Computation of Generating Functions for Biological Molecules
From MaRDI portal
Cited in
(24)- Combinatorial design of pseudoknot RNA
- Stacks in canonical RNA pseudoknot structures
- On the decomposition of \(k\)-noncrossing RNA structures
- On some new sequences generalizing the Catalan and Motzkin numbers
- Combinatorics of RNA secondary structures
- Linear trees and RNA secondary structure
- Parametric and ensemble sequence alignment algorithms
- The rainbow spectrum of RNA secondary structures
- Some canonical sequences of integers
- The block spectrum of RNA pseudoknot structures
- Statistics of topological RNA structures
- Irreducibility in RNA structures
- Enumerating secondary structures and structural moieties for circular RNAs
- Combinatorics of RNA structures with pseudoknots
- Asymptotic enumeration of RNA secondary structure
- General combinatorics of RNA secondary structure
- A semi-bijective algorithm for saturated extended 2-regular simple stacks
- Topological classification and enumeration of RNA structures by genus
- Bijective enumeration of general stacks
- Symmetric circular matchings and RNA folding
- Explicit enumeration formulas for m-regular simple stacks
- Local connectivity of neutral networks
- Asymptotic enumeration of RNA structures with pseudoknots
- RNA pseudoknot structures with arc-length \(\geq 3\) and stack-length \(\geq \sigma \)
This page was built for publication: Computation of Generating Functions for Biological Molecules
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3890473)
