• Corpus ID: 238259140

An impossible utopia in distance geometry

@article{Abud2021AnIU,
  title={An impossible utopia in distance geometry},
  author={Germano Abud and Jorge Alencar and Carlile Lavor and Leo Liberti and Antonio Mucherino},
  journal={ArXiv},
  year={2021},
  volume={abs/2110.01231}
}
The Distance Geometry Problem asks for a realization of a given weighted graph in R . Two variants of this problem, both originating from protein conformation, are based on a given vertex order (which abstracts the protein backbone). Both variants involve an element of discrete decision in the realization of the next vertex in the order using K preceding (already realized) vertices. The difference between these variants is that one requires the K preceding vertices to be contiguous. The… 

Figures from this paper

References

SHOWING 1-10 OF 32 REFERENCES

New Error Measures and Methods for Realizing Protein Graphs from Distance Data

This paper focuses on the application to the conformation of proteins in space, which is a basic step in determining protein function: given interval estimations of some of the inter-atomic distances, find their shape.

The discretizable molecular distance geometry problem

It is shown that under a few assumptions usually satisfied in proteins, the MDGP can be formulated as a search in a discrete space and the DMDGP is NP-hard and a solution algorithm called Branch-and-Prune (BP) is proposed.

Some theoretical aspects of position-location problems

  • Y. Yemini
  • Computer Science
    20th Annual Symposium on Foundations of Computer Science (sfcs 1979)
  • 1979
Among the major results presented is the discovery of a large class of geometrical decision problems, all of which are randomly decidable (i.e., decidable by a probabilistic polynomial-time algorithm), but many of which seem to be Intractable.

Discretization vertex orders in distance geometry

An algorithm to enumerate all possible protein conformations verifying a set of distance constraints

An interval Branch-and-Prune algorithm (iBP) to solve the Distance Geometry Problem (DGP) associated to protein structure determination and generate protein conformations satisfying distance constraints is described.

The discretizable distance geometry problem

It is shown experimentally that as distance thresholds decrease, PDB protein graphs which fail to be in the DMDGP still belong to DDGP3, which means that they can still be solved using a discrete search.

Influence of Pruning Devices on the Solution of Molecular Distance Geometry Problems

Information derived from Nuclear Magnetic Resonance (NMR) is used to conceive and add new pruning devices to the iBP algorithm, and their influence on the performances of the algorithm is studied.

Discretization orders for distance geometry problems

This work formalizes the decision problem of determining whether such an order exists for a given graph and shows that this problem is NP-complete in general and polynomial for fixed dimension K.