Efficient enumeration of stereoisomers of tree structured molecules using dynamic programming

DOI10.1007/s10910-010-9789-9zbMath1221.92085OpenAlexW2068237573MaRDI QIDQ535320

Tomoki Imada, Tatsuya Akutsu, Hiroshi Nagamochi, Shunsuke Ota

Publication date: 11 May 2011

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

Full work available at URL: https://doi.org/10.1007/s10910-010-9789-9

zbMATH Keywords

stereoisomerschemical enumeration

Mathematics Subject Classification ID

Trees (05C05) Applications of graph theory (05C90) Dynamic programming (90C39) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)

Related Items (3)

Unranking of small combinations from large sets ⋮ Enumerating DNA polyhedral links ⋮ COOMA: A Components Overlaid Mining Algorithm for Enumerating Connected Subgraphs with Common Itemsets

Cites Work

• On an algorithm of Zemlyachenko for subtree isomorphism
• Kombinatorische Anzahlbestimmungen für Gruppen, Graphen und chemische Verbindungen
• The Enumeration of Locally Restricted Graphs (II)

This page was built for publication: Efficient enumeration of stereoisomers of tree structured molecules using dynamic programming