Chemical trees enumeration algorithms

4OR

Volumn 1, Issue 1, 2003, Pages 67-83

  Aringhieri, Roberto ^a   Hansen, Pierre ^b   Malucelli, Federico ^c  

^a UNIVERSITY OF MODENA AND REGGIO EMILIA   (Italy)

^b UNIVERSITÉ DE MONTRÉAL   (Canada)

^c POLITECNICO DI MILANO   (Italy)

Author keywords

applications; enumeration of graphs and maps; Exact enumeration problems; generating functions; trees

Indexed keywords

EID: 49449109559     PISSN: 16194500     EISSN: 16142411     Source Type: Journal    
DOI: 10.1007/s10288-002-0008-9     Document Type: Article

References (12)

1. Aringhieri R, Hansen P, Malucelli F (2001)ALinearAlgorithm for The HyperWiener Index of Chemical Trees. J Chem Inf Comput Sci 41(4): 958-963.
2. Avis D, Fukuda K (1996) Reverse Search for enumeration. Discrete Applied Mathematics 65: 21-46.
3. Berzelius JJ (1830) Ann. Phys. Chem. 19: 305 ff.
4. Cayley A (1875) On the Analytical Figures called Trees in Mathematics and Their Applications to the Theory of Chemical Combinations. Ber. Dtsch. Chem. Ges. 8: 1056-1059.
5. Corey EJ, WipkeWT (1969) Science 166: 178 ff.
6. Hansen P, Jaumard B, Labatteux C, Zeng M (1994) Coding Chemical Trees with the Centered N-Tuple Code. J. Chem. Inf. Comput. Sci. 34: 782-790.
7. Hansen P, Pitteloud G, Van der Klink R (1995) Enumeration d'Alcanes par le Code N-Tuple et la Recherche Inversée. Travail de semestre DMA, EPFL, Lausanne.
8. Jordan C (1869) Reine Angew Math pp. 185 ff.
9. KvasničkaV, Pospichal J (1991) Constructive Enumeration of Acyclic Molecules. Collect Czech Chem Commun 56: 1777-1802.
10. Lederberg J, Sutherland JL, Buchanan BG, Feigenbaum EA, LindsayRK (1980)Application ofArtificial Intelligence for Organic Chemistry: the DENDRAL project. McGraw-Hill: NewYork.
11. Read RC (1972) Graph Theory and Computing. Academic Press: NewYork, Chapter 12, pp. 153 ff.
12. Trinajstić N, Nicolić S, Knop JV, Müller WR, Szymanski K (1991) Computational Chemical Graph Theory. Ellis Horwood: NewYork.