Barakat M T, Dean P M
Department of Pharmacology, University of Cambridge, U.K.
J Comput Aided Mol Des. 1990 Sep;4(3):317-30. doi: 10.1007/BF00125018.
This paper considers some of the landscape problems encountered in matching molecules by simulated annealing. Although the method is in theory ergodic, the global minimum in the objective function is not always encountered. Factors inherent in the molecular data that lead the trajectory of the minimization away from its optimal route are analysed. Segments comprised of the C alpha atoms of dihydrofolate reductase are used as test data. The evolution of a reverse ordering landscape problem is examined in detail. Where such patterns in the data could lead to incorrect matches, the problem can in part be circumvented by assigning an initial random ordering to the molecules.
