Randomly sampling molecules

SIAM Journal on Computing

Volumn 29, Issue 3, 2000, Pages 834-853

  Goldberg, Leslie Ann ^a   Jerrum, Mark ^b  

^a UNIVERSITY OF WARWICK   (United Kingdom)

^b UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

P lya theory; Random graphs; Structural isomers

Indexed keywords

ALGORITHMS; BOUNDARY CONDITIONS; POLYNOMIALS; RANDOM PROCESSES;

POLYA THEORY; RANDOM GRAPHS; RANDOMLY SAMPLING MOLECULES; STRUCTURAL ISOMERS;

SAMPLING;

EID: 0033293712     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539797318864     Document Type: Article

References (26)

1. E. A. BENDER AND E. R. CANFIELD, The asymptotic number of labelled graphs with given degree sequences, J. Combin. Theory Ser. A, 24 (1978), pp. 296-307.
2. C. BENECKE, R. GRUND, R. HOHBERGER, A. KERBER, R. LAUE, AND T. WIELAND, MOLGEN+, a generator of connectivity isomers and stereoisomers for molecule structure elucidation, Anal. Chem. Acta., 314 (1995), pp. 141-147.
3. B. BOLLOBÁS, The asymptotic number of unlabelled regular graphs, J. London Math. Soc., 26 (1982), pp. 201-206.
4. B. BOLLOBÁS, Almost all regular graphs are Hamiltonian, European J. Combin., 4 (1983), pp. 97-106.
5. B. BOLLOBÁS, Random Graphs, Academic Press, New York, London, 1985.
6. N. G. DE BRUIJN, Pólya's theory of counting, in Applied Combinatorial Mathematics, E. F. Beckenbach, ed., John Wiley & Sons, Inc., New York, 1964; see especially section 5.13.
7. J. D. DIXON AND H. S. WILF, The random selection of unlabeled graphs, J. Algorithms, 4 (1983), pp. 205-213.
8. J. L. FAULON, On using graph-equivalent classes for the structure elucidation of large molecules, J. Chem. Inf. Comput. Sci., 32 (1992), pp. 337-348.
9. J. L. FAULON, Stochastic generator of chemical structure: 1. Application to the structure elucidation of large molecules, J. Chem. Inf. Comput. Sci., 34 (1994), pp. 1204-1218.
10. J. L. FAULON, private communication, Sandia National Laboratories, Albuquerque, NM, 1995.
11. P. FLAJOLET, P. ZIMMERMAN, AND B. VAN CUTSEM, A calculus for the random generation of labelled combinatorial structures, Theoret. Comput. Science, 132 (1994), pp. 1-35.
12. P. FLAJOLET, P. ZIMMERMAN, AND B. VAN CUTSEM, A calculus for the random generation of unlabelled combinatorial structures, in preparation.
13. M. JERRUM AND A. SINCLAIR, Fast uniform generation of regular graphs, Theoret. Comput. Sci., 73 (1990), pp. 91-100.
14. B. D. MCKAY AND N. C. WORMALD, Uniform generation of random regular graphs of moderate degree, J. Algorithms, 11 (1990), pp. 52-67.
15. A. NIJENHUIS AND H. S. WILF, Combinatorial Algorithms, 2nd ed., Academic Press, New York, London, 1978.
16. G. PÓLYA AND R. C. READ, Combinatorial Enumeration of Groups, Graphs, and Chemical Compounds, Springer-Verlag, Berlin, New York, 1987.
17. R. C. READ, Some recent results in chemical enumeration, in Graph Theory and its Applications, Springer-Verlag, Berlin, New York, 1972.
18. R. C. READ, The enumeration of acyclic chemical compounds, in Chemical Applications of Graph Theory, A. T. Balaban, ed., Academic Press, New York, London, 1976.
19. H. ROBBINS, A remark on Stirling's formula, Amer. Math. Monthly, 62 (1955), pp. 26-29.
20. V. SPERSCHNEIDER AND G. ANTONIOU, Logic: A Foundation for Computer Science, Addison-Wesley, Reading, MA, 1991, chapter 13.
21. T. WIELAND, A. KERBER, AND R. LAUE, Principles of the generation of constitutional and configurational isomers, J. Chem. Inf. Comput. Sci., 36 (1996), pp. 431-439.
22. H. S. WILF, The uniform selection of free trees, J. Algorithms, 2 (1981), pp. 204-207.
23. N. C. WORMALD, Some Problems in the Enumeration of Labelled Graphs, Ph.D. thesis, Department of Mathematics, University of Newcastle, New South Wales, Australia, 1978.
24. N. C. WORMALD, The asymptotic connectivity of labelled regular graphs, J. Combin. Theory Ser. B, 31 (1981), pp. 156-167.
25. N. C. WORMALD, Generating random unlabelled graphs, SIAM J. Comput., 16 (1987), pp. 717-727.
26. S. ZHAN, On Hamiltonian line graphs and connectivity, Discrete Math., 89 (1991), pp. 89-95.