An alternative approach to distance geometry using L∞ distances
暂无分享,去创建一个
A standard task in distance geometry is to calculate one or more sets of Cartesian coordinates for a set of points that satisfy given geometric constraints, such as bounds on some of the L 2 distances. Using instead L ∞ distances is attractive because distance constraints can be expressed as simple linear bounds on coordinates. Likewise, a given matrix of L ∞ distances can be rather directly converted to coordinates for the points. It can happen that multiple sets of coordinates correspond precisely to the same matrix of L ∞ distances, but the L 2 distances vary only modestly. Practical examples are given of calculating protein conformations from the sorts of distance constraints that one can obtain from nuclear magnetic resonance experiments.
[1] Jeff Edmonds. Embedding into l∞2 Is Easy, Embedding into l∞3 Is NP-Complete , 2008, Discret. Comput. Geom..
[2] Gordon M. Crippen,et al. Distance Geometry and Molecular Conformation , 1988 .
[3] T. N. Bhat,et al. The Protein Data Bank , 2000, Nucleic Acids Res..
[4] Leonard M. Blumenthal,et al. Theory and applications of distance geometry , 1954 .