Summary
This paper extends an application of the method of simulated annealing for molecular matching so that the best common subsets of atom positions can be identified. Null correspondences are introduced into the difference distance matrix to enable poorly matched positions to be ignored in minimizing the objective function. The efficiency of the algorithm in finding correct subsets is rigorously tested.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Barakat, M.T. and Dean, P.M., J. Comput.-Aided Mol. Design, 4 (1990) 295.
Barakat, M.T. and Dean, P.M., J. Comput.-Aided Mol. Design, 4 (1990) 317.
Papadopoulos, M.C. and Dean, P.M., J. Comput.-Aided Mol. Design, 5 (1991) 119.
Metropolis, N., Rosenbluth, A., Rosenbluth, M., Teller, A. and Teller, E., J. Chem. Phys., 21 (1953) 1087.
Huang, M.D., Romeo, F. and Sangiovanni-Vincentelli, A., An efficient general cooling schedule for simulated annealing. In Proceedings IEEE International Conference on Computer-Aided Design, Santa Clara, CA, 1986, pp. 381–384.
Danziger, D.J. and Dean, P.M., J. Theor. Biol. 116 (1985) 215.
Toulouse, G., Commun. Phys. 2 (1977) 115.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Barakat, M.T., Dean, P.M. Molecular structure matching by simulated annealing. III. The incorporation of null correspondences into the matching problem. J Computer-Aided Mol Des 5, 107–117 (1991). https://doi.org/10.1007/BF00129750
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/BF00129750