Determining molecular structure from interatomic distances is an important and challenging problem. Given a molecule with n atoms, lower and upper bounds on interatomic distances can usually be obtained only for a small subset of the n(n-1)/2 atom pairs, using NMR. Given the bounds so obtained on the distances between some of the atom pairs, it is often useful to compute tight bounds on all the n(n-1)/2 pairwise distances. This process is referred to as bound-smoothing. The initial lower and upper bounds for the pairwise distances not measured are usually assumed to be 0 and /spl infin/. One method for bound-smoothing is to use the limits imposed by the triangle inequality. The distance bounds so obtained can often be tightened further by applying the tetrangle inequality-the limits imposed on the six pairwise distances among a set of four atoms (instead of three for the triangle inequalities). The tetrangle inequality is expressed by the Cayley-Menger determinants. For every quadruple of atoms, each pass of the tetrangle-inequality bound-smoothing procedure finds upper and lower limits on each of the six distances in the quadruple. Applying the tetrangle inequalities to each of the (/sub 4//sup n/) quadruples requires /spl Theta/(n/sup 4/) time. Here, we propose a parallel algorithm for bound-smoothing employing the tetrangle inequality. Each pass of our algorithm requires /spl Theta/(n/sup 3/ log n) time on a CREW PRAM with /spl Theta/(n/log n) processors. An implementation of this parallel algorithm on the Intel Paragon XP/S and its performance are also discussed.
[1]
Fred S. Roberts,et al.
Applied Combinatorics
,
1984
.
[2]
Timothy F. Havel,et al.
Computational experience with an algorithm for tetrangle inequality bound smoothing
,
1989
.
[3]
David P. Dailey.
Uniqueness of colorability and colorability of planar 4-regular graphs are NP-complete
,
1980,
Discret. Math..
[4]
Andries E. Brouwer,et al.
Optimal Packings of K4's into a Kn
,
1979,
J. Comb. Theory A.
[5]
David B. Searls,et al.
Grand challenges in computational biology
,
1998
.
[6]
B. Schweitzer,et al.
Solution structure of murine macrophage inflammatory protein-2.
,
1998,
Biochemistry.
[7]
M. Nilges,et al.
Computational challenges for macromolecular structure determination by X-ray crystallography and solution NMRspectroscopy
,
1993,
Quarterly Reviews of Biophysics.
[8]
Timothy F. Havel,et al.
Shortest-path problems and molecular conformation
,
1988,
Discret. Appl. Math..
[9]
Leo G. Chouinard,et al.
Partitions of the 4-subsets of a 13-set into disjoint projective planes
,
1983,
Discret. Math..
[10]
Gordon M. Crippen,et al.
Distance Geometry and Molecular Conformation
,
1988
.