Summary
If atom assignment onto 3D molecular graphs is to be optimized, an efficient scheme for placement must be developed. The strategy adopted in this paper is to analyze the molecular graphs in terms of cyclical and non-cyclical nodes; the latter are further divided into terminal and non-terminal nodes. Molecular fragments, from a fragments database, are described in a similar way. A canonical numbering scheme for the fragments and the local subgraph of the molecular graph enables fragments to be placed efficiently onto the molecular graph. Further optimization is achieved by placing similar fragments into bins using a hashing scheme based on the canonical numbering. The graph perception algorithm is illustrated in detail.
Similar content being viewed by others
References
Barakat, M.T. and Dean, P.M., J. Comput.-Aided Mol. Design, 9 (1995) 341.
Allen, F.H., Bellard, S., Brice, M.D., Cartwright, B.A., Doubleday, A., Higgs, H., Hummelink, T., Hummelink-Peters, B.G., Kennard, O., Motherwell, W.D.S., Rogers, J.R. and Watson, D.G., Acta Crystallogr. B35 (1979) 2331.
Barakat, M.T. and Dean, P.M., J. Comput.-Aided Mol. Design, 9 (1995) 359.
Downs, G.M., Gillet, V.J., Holliday, J.D. and Lynch, M.F., J. Chem. Inf. Comput. Sci., 29 (1989) 172.
Wipke, W.T. and Dyott, T.M., J. Chem. Inf. Comput. Sci., 15 (1975) 140.
Welch, J., J. Assoc. Comput. Machinery, 13 (1966) 205.
Gibbs, H., J. Assoc. Comput. Machinery, 16 (1969) 564.
Gray, N.A.B., Computer Assisted Structure Elucidation, Wiley, New York, NY, 1986.
Sheridan, R.P., Nilakantan, R., RusinkoIII, A., Bauman, N., Haraki, K.S. and Venkatarghavan, R., J. Chem. Inf. Comput. Sci., 29 (1989) 255.
Sedgewick, R., Algorithms, Addison Wesley, Reading, MA, 1983.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Barakat, M.T., Dean, P.M. The atom assignment problem in automated de novo drug design. 2. A method for molecular graph and fragment perception. J Computer-Aided Mol Des 9, 351–358 (1995). https://doi.org/10.1007/BF00125176
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/BF00125176