Aringhieri, R. and Hansen, P. and Malucelli, Federico (1999) Chemical Tree Enumeration Algorithms. Technical Report del Dipartimento di Informatica . Università di Pisa, Pisa, IT.
Postscript (GZip) - Published Version Available under License Creative Commons Attribution No Derivatives. Download (107Kb) |
Official URL: http://compass2.di.unipi.it/TR/files/TR-99-09.ps.g...
Abstract
The need to generate graphs representing chemical structures suggested the use of computer and as a consequence the delevopment of efficient enumerating algorithms. This paper considers the isomeric acyclic structures enumeration focusin on the alkane molecular family. Two new algorithms based on Reverse Search are presented. The main concern of this paper is to highlight the importance of the asymptotic complexity and running time behaviour in the analysis of enumeration algorithms.
Item Type: | Book |
---|---|
Uncontrolled Keywords: | enumeration, molecular codes, trees |
Subjects: | Area01 - Scienze matematiche e informatiche > INF/01 - Informatica |
Divisions: | Dipartimenti (until 2012) > DIPARTIMENTO DI INFORMATICA |
Depositing User: | dott.ssa Sandra Faita |
Date Deposited: | 27 Jan 2015 09:53 |
Last Modified: | 27 Jan 2015 09:53 |
URI: | http://eprints.adm.unipi.it/id/eprint/2012 |
Repository staff only actions
View Item |