Polynomial cases of the Discretizable Molecular Distance Geometry Problem
Computational Geometry
2011-03-08 v1 Computational Engineering, Finance, and Science
Data Structures and Algorithms
Quantitative Methods
Abstract
An important application of distance geometry to biochemistry studies the embeddings of the vertices of a weighted graph in the three-dimensional Euclidean space such that the edge weights are equal to the Euclidean distances between corresponding point pairs. When the graph represents the backbone of a protein, one can exploit the natural vertex order to show that the search space for feasible embeddings is discrete. The corresponding decision problem can be solved using a binary tree based search procedure which is exponential in the worst case. We discuss assumptions that bound the search tree width to a polynomial size.
Cite
@article{arxiv.1103.1264,
title = {Polynomial cases of the Discretizable Molecular Distance Geometry Problem},
author = {Leo Liberti and Carlile Lavor and Benoit Masson and Antonio Mucherino},
journal= {arXiv preprint arXiv:1103.1264},
year = {2011}
}