A semi-bijective algorithm for saturated extended 2-regular simple stacks
From MaRDI portal
Publication:2689170
Recommendations
Cites work
- A general bijective algorithm for trees.
- Asymptotic expected number of base pairs in optimal secondary structure for random RNA using the Nussinov--Jacobson energy model
- Combinatorial algorithms for protein folding in lattice models: a survey of mathematical results
- Combinatorial Computational Biology of RNA
- Combinatorics of contacts in protein contact maps
- Combinatorics of locally optimal RNA secondary structures
- Combinatorics of RNA Hairpins and Cloverleaves
- Computation of Generating Functions for Biological Molecules
- Crossings and nestings of matchings and partitions
- scientific article; zbMATH DE number 3943610 (Why is no real title available?)
- scientific article; zbMATH DE number 3675903 (Why is no real title available?)
- scientific article; zbMATH DE number 3308309 (Why is no real title available?)
- Linear trees and RNA secondary structure
- Linked partitions and linked cycles
- On a class of linked diagrams. I: Enumeration
- On some new sequences generalizing the Catalan and Motzkin numbers
- Regular simple queues of protein contact maps
- RNA secondary structure: a complete mathematical analysis
Cited in
(5)
This page was built for publication: A semi-bijective algorithm for saturated extended 2-regular simple stacks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2689170)