Distance Geometry : Theory, Methods, and Applications

This volume is a collection of research surveys on the Distance Geometry Problem (DGP) and its applications. It will be divided into three parts: Theory, Methods and Applications. Each part  will contain at least one survey and several research papers.

The first part, Theory, will deal with theoretical aspects of the DGP, including a new class of problems and the study of its complexities as well as the relation between DGP and other related topics, such as: distance matrix theory, Euclidean distance matrix completion problem, multispherical structure of distance matrices, distance geometry and geometric algebra, algebraic distance geometry theory, visualization of K-dimensional structures in the plane, graph rigidity, and theory of discretizable DGP: symmetry and complexity.

The second part, Methods, will discuss mathematical and computational properties of methods developed to the problems considered in the first chapter including continuous methods (based on Gaussian and hyperbolic smoothing, difference of convex functions, semidefinite programming, branch-and-bound), discrete methods (based on branch-and-prune, geometric build-up, graph rigidity), and also heuristics methods (based on simulated annealing, genetic algorithms, tabu search, variable neighborhood search).

Applications will comprise the third part and will consider applications of DGP to NMR structure calculation, rational drug design, molecular dynamics simulations, graph drawing and sensor network localization.

This volume will be the first edited book on distance geometry and applications. The editors are in correspondence with the major contributors to the field of distance geometry, including important research centers in molecular biology such as Institut Pasteur in Paris.

Distance Geometry: Theory, Methods, and Applications is the first collection of research surveys dedicated to distance geometry and its applications. The first part of the book discusses theoretical aspects of the Distance Geometry Problem (DGP), where the relation between DGP and other related subjects are also presented. Covered topics include distance matrix theory, Euclidean distance matrix completion, multispherical structure of distance matrices, geometric algebra, algebraic distance geometry theory, visualization of K-dimensional structures in the plane, graph rigidity, and theory of discretizable DGP.

The second part of this volume presents mathematical and computational properties of methods developed to the problems discussed in the first portion, including continuous methods (based on Gaussian and hyperbolic smoothing, difference of convex functions, semidefinite programming, branch-and-bound), discrete methods (based on branch-and-prune, geometric build-up, graph rigidity), and also heuristics methods (based on simulated annealing, genetic algorithms, tabu search, variable neighborhood search).

Applications comprise the third part of the book, which is mainly devoted to the application of DGP to NMR structure calculation. This is an important and strongly multidisciplinary application in biology and biomedicine.