Counting glycans revisited

DOI10.1007/s00285-013-0721-3zbMath1360.92131OpenAlexW2093825329WikidataQ51170076 ScholiaQ51170076MaRDI QIDQ464771

J. Herrera, D. Rodríguez-Gómez

Publication date: 30 October 2014

Published in: Journal of Mathematical Biology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00285-013-0721-3

zbMATH Keywords

algorithmscounting chemical structurescounting treesglycansPólya's enumeration theorem

Mathematics Subject Classification ID

Trees (05C05) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)

Related Items (1)

Maximum of the sum of consecutive terms in random permutations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A fast and simple algorithm for the money changing problem
• Counting rooted trees: the universal law \(t(n)\sim C\rho^{-n} n^{-3/2}\)
• Kombinatorische Anzahlbestimmungen für Gruppen, Graphen und chemische Verbindungen
• The number of trees
• Determination of Glycan Structure from Tandem Mass Spectra

This page was built for publication: Counting glycans revisited