### Abstract

Molecular similarity index measures the similarity between two molecules. Computing the optimal similarity index is a hard global optimization problem. Since the objective function value is very hard to compute and its gradient vector is usually not available, previous research has been based on non-gradient algorithms such as random search and the simplex method. In a recent paper, McMahon and King introduced a Gaussian approximation so that both the function value and the gradient vector can be computed analytically. They then proposed a steepest descent algorithm for computing the optimal similarity index of small molecules. In this paper, we consider a similar problem. Instead of computing atom-based derivatives, we directly compute the derivatives with respect to the six free variables describing the relative positions of the two molecules.. We show that both the function value and gradient vector can be computed analytically and apply the more advanced BFGS method in addition to the steepest descent algorithm. The algorithms are applied to compute the similarities among the 20 amino acids and biomolecules like proteins. Our computational results show that our algorithm can achieve more accuracy than previous methods and has a 6-fold speedup over the steepest descent method.

Original language | English (US) |
---|---|

Pages (from-to) | 299-312 |

Number of pages | 14 |

Journal | Journal of Global Optimization |

Volume | 14 |

Issue number | 3 |

DOIs | |

State | Published - May 1999 |

Externally published | Yes |

### Keywords

- Computational biology
- Global optimization
- Molecular similarity

### ASJC Scopus subject areas

- Computer Science Applications
- Management Science and Operations Research
- Control and Optimization
- Applied Mathematics