Implementation of the Three-Dimensional-Pattern Search Problem on Hopfield-like Neural Networks

Publisher Website
Google Scholar
Abstract
The three-dimensional (3D)-pattern search problem can be summarized as finding, in a molecule, the subset of atoms that have the most similar spatial arrangement as those of a given 3D pattern. For this NP-complete combinatorial optimization problem we propose, by analogy to the travelling salesman problem, a new method taking advantage of the capability of Hopfield-like neural networks to carry out combinatorial optimization of an objective function. This objective function is built from the sum of the differences of interatomic distances in the pattern and the molecule. Here we present the implementation we have found of the 3D-pattern search problem on Hopfield-like neural networks. Initial tests indicate that this approach not only successfully retrieves a given pattern, but can also suggest partial solutions having one or two atoms less than the given pattern, an interesting feature in the case of local conformational flexibility of the molecule. The distributed representation of the problem on Hopfield-like neural networks offers a good perspective for parallel implementation.