Genetic algorithm for solving the Euclidean distance matrices completion problem

Abstract

This paper presents a genetic algorithm to solve the Euclidean distance matrices completion problem and to determine three-dimensional configurations of points which generate the corresponding Euclidean distance matrices. This new approach becomes important for applications in molecular conformation problems where it is necessary to determine molecular configurations from incomplete nuclear magnetic resonance data.