Polynomial cases of the Discretizable Molecular Distance Geometry Problem

Details Polynomial cases of the Discretizable Molecular Distance Geometry Problem Polynomial cases of the Discretizable Molecular Distance Geometry Problem

2011-03-07

arxiv.org/abs/1103.1264v1

Computer Science

Computational Geometry

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Polynomial cases of the Discretizable Molecular Distance Geometry Problem does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Polynomial cases of the Discretizable Molecular Distance Geometry Problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Polynomial cases of the Discretizable Molecular Distance Geometry Problem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-607036