A molecular structure matching problem

Computers and Operations Research

Volumn 24, Issue 1, 1997, Pages 25-35

  Kincaid, Rex K ^a  

^a Dept of Economics and Thomas Jefferson Program in Public Policy at the College of William and Mary   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SIMULATION; HEURISTIC METHODS; MOLECULAR STRUCTURE; OPTIMIZATION; PROBLEM SOLVING; SIMULATED ANNEALING; STATISTICAL METHODS;

INTERATOMIC DISTANCE MATRICES; MOLECULAR STRUCTURE MATCHING PROBLEM; PERMUTATION; TABU SEARCH;

OPERATIONS RESEARCH;

EID: 0030787231     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0305-0548(96)00030-5     Document Type: Article

References (25)

1. Snow, M. E., Powerful Simulated-Annealing Algorithm Locates Global Minimum of Protein-Folding Potentials from Multiple Starting Conformations,. J. of Computational Chemistry, 1992, 13, 579-584.
2. von Freyberg, B. and Braun, W., Efficient Search for all Low Energy Conformations of Polypeptides by Monte Carlo Search Methods,. J. of Computational Chemistry, 1991, 12, 1065-1076.
3. Kincaid, R. K., Martin, A. D. and Hinkley, J. A., Heuristic Search for the Polymer Straightening Problem, to appear Computational Polymer Science, 1995.
4. Pepperrell, C. A. and Willett, P., Techniques for the Calculation of Three-Dimensional Structural Similarity Using Inter-Atomic Distances,. J. of Computer Aided Molecular Design, 1991, 5, 455-474.
5. Barakat, M. T. and Dean, P. M., Molecular Structure Matching by Simulated Annealing. I.A Comparison Between Different Cooling Schedules,. J. of Computer-Aided Molecular Design, 1990, 4, 295-316.
6. Dean, P. M., Molecular Recognition: the measurement and search for molecular similarity in ligand-receptor interaction. In Concepts and Applications of Molecular Similarity, eds M. Johnson and G. Maggiora. Wiley, New York, 1990, pp. 211-237.
7. Willet, P., Similarity and Clustering in Chemical information Systems. Research Studies Press, John Wiley and Sons, 1987.
8. Barakat, M. T. and dean, P. M., Molecular structure matching by simulated annealing. II. an exploration of the evolution of configuration landscape problems,. J. of Computer-Aided Molecular Design, 1990, 4, 317-330.
9. Barakat, M. T. and Dean, P. M., Molecular structure matching by simulated annealing. III. The incorporation of null correspondences into the matching problem,. J. of Computer-Aide Molecular Design, 1991, 5, 107-117.
10. Glunt, W., Hayden, T. L., Hong, S. and Wells, J., An alternating projection algorithm for computing the nearest euclidean distance matrix,. SIAM J. Matrix Analysis and Applications, 1990, 11, 589-600.
11. Bernstein, F. C., Koetzle, T. F., Williams, G. J. B., Meyer, E. F.Jr, Brice, M. D., Rodgers, J. R., Kennard, O., Shimanouchi, T. and Tasumi, M., The protein data bank: a computer-based archival file for macromolecular structures. J. Molecular Biology, 1977, 112, 535-542.
12. Aarts, E. H. L. and Korst, J. H. M. , Simulated Annealing and Boltzmann Machines, John Wiley and Sons, New York, 1989.
13. Bachar, O., Fischer, D., Nussinov, R. and Wolfson, H., A computer vision based technique for 3-D sequence-independent structural comparison of proteins,. Protein Engineering, 1993, 6, 279-288.
14. Holm, L. and Sandor, C., Protein structure comparison by alignment of distance matrices. J. Molecular Biology, 1993, 233, 123-138.
15. Filman, D. J., Bolin, J. T., Matthews, D. A. and Kraut, J., Crystal structures of Escherichia Coli and Lactobacillus Casei diydrofolate reductase refined at 1.7 angstroms resolution: environment of bound NADPH and implications for catalysis. J. of Biol. Chem., 1982, 257, 13663.
16. Aarts, E. H. L., and van Laarhoven, P. J. M., Simulated Annealing: Theory and Applications. Reidel, Dodrecht, 1988.
17. Johnson, D. S., Aragon, C. R., McGeoch, L. A. and Schevon, C., Optimization by simulated annealing: an experimental evaluation. Part I, graph partitioning. Operations Research, 1989, 37, 865-893.
18. Glover, F., Tabu Search, Part I. ORSA J. on Computing, 1989, 1, 190-206.
19. Battiti, R. and Techiolli, G., The reactive tabu search. ORSA J. On Computing, 1994, 6, 126-140.
20. Rockafellar, T., Convex Analysis. Princeton University Press, Princeton, New Jersey, 1972.
21. Skorin-Kapov, J., Tabu search applied to the quadratic assignment problem. ORSA J. of Computing, 1990, 2, 33-45.
22. Glover, F., Tabu search: a tutorial. INTERFACES, 1990, 20, 74-94.
23. Kincaid, R. K. and Berger, R. T., The damper placement problem on space truss structures. Location Sci., 1993, 1, 219-234.
24. Kelly, J. P., Laguna, M. and Glover, F., A Study of the Diversification Strategies for the Quadratic Assignment Problem. Working Paper, University of Colorado at Boulder, 1991.
25. Skorin-Kapov, D., Skorin-Kapov, J. and O'Kelly, M., Tight linear programming relaxations of uncapacitated p-Hub median problems. Working Paper, W.A. Harriman School for Management and Policy, SUNY at Stony Brook, Stony Brook, NY 11794-3775, 1994.