Bijective enumeration of general stacks
From MaRDI portal
Publication:6564070
Recommendations
Cites work
- scientific article; zbMATH DE number 3675903 (Why is no real title available?)
- A semi-bijective algorithm for saturated extended 2-regular simple stacks
- Combinatorial Computational Biology of RNA
- Combinatorial algorithms for protein folding in lattice models: a survey of mathematical results
- Combinatorics of RNA secondary structures
- Combinatorics of contacts in protein contact maps
- Computation of Generating Functions for Biological Molecules
- Crossings and nestings of matchings and partitions
- Dyck path enumeration
- Introduction to enumerative combinatorics. With a foreword by Richard Stanley
- 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
- RNA secondary structure: a complete mathematical analysis
- Regular simple queues of protein contact maps
This page was built for publication: Bijective enumeration of general stacks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6564070)