Access count of this item: 237

Files in This Item:
File Description SizeFormat 
s10910-010-9789-9.pdf452.24 kBAdobe PDFView/Open
Title: Efficient enumeration of stereoisomers of tree structured molecules using dynamic programming
Authors: Imada, Tomoki
Ota, Shunsuke
Nagamochi, Hiroshi  kyouindb  KAKEN_id
Akutsu, Tatsuya  kyouindb  KAKEN_id
Author's alias: 永持, 仁
Keywords: Chemical enumeration
Stereoisomers
Tree structured molecules
Dynamic programming
Issue Date: Apr-2011
Publisher: Springer Science+Business Media, LLC.
Journal title: Journal of Mathematical Chemistry
Volume: 49
Issue: 4
Start page: 910
End page: 970
Abstract: Nonredundant and exhaustive generation of stereoisomers of a chemical compound with a specified constitution is one of the important tools for molecular structure elucidation and molecular design. In this paper, we deal with chemical compounds composed of carbon, hydrogen, oxygen and nitrogen atoms whose graphical structures are tree-like graphs because these compounds are most fundamental, and consider stereoisomers that can be generated by asymmetric carbon atoms and double bonds between two adjacent carbon atoms. Based on dynamic programming, we propose an algorithm of generating all stereoisomers without duplication. We treat a given tree-like graph as a tree rooted at its structural center. Our algorithm first computes recursively the numbers of stereoisomers of the subgraphs induced by the descendants of each vertex, and then constructs each stereoisomer by backtracking the process of computing the numbers of stereoisomers. Our algorithm correctly counts the number of stereoisomers in O(n) time and space, and correctly enumerates all the stereoisomers in O(n) space and in O(n) time per stereoisomer, where n is the number of atoms in a given structure. The source code of the program implementing the proposed algorithm is freely available for academic use upon request.
Rights: The final publication is available at www.springerlink.com
This is not the published version. Please cite only the published version. この論文は出版社版でありません。引用の際には出版社版をご確認ご利用ください。
URI: http://hdl.handle.net/2433/139571
DOI(Published Version): 10.1007/s10910-010-9789-9
Appears in Collections:Journal Articles

Show full item record

Export to RefWorks


Export Format: 


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.