Computational experience with a parallel algorithm for tetrangle inequality bound smoothing

被引:5
|
作者
Rajan, K [1 ]
Deo, N [1 ]
机构
[1] Univ Cent Florida, Sch Comp Sci, Orlando, FL 32816 USA
关键词
D O I
10.1006/bulm.1999.0123
中图分类号
Q [生物科学];
学科分类号
07 ; 0710 ; 09 ;
摘要
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 tighter 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 infinity. 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 hound smoothing procedure finds upper and lower limits on each of the six distances in the quadruple. Applying the tetrangle inequalities to each of the ((n)(4)) quadruples requires O(n(4)) time. Here, we propose a parallel algorithm fbr bound smoothing employing the tetrangle inequality. Each pass of our algorithm requires O(n(3) log n) time on a CREW PRAM (Concurrent Read Exclusive Write Parallel Random Access Machine) with O(n/log n) processors. An implementation of this parallel algorithm on the Intel Paragon XP/S and its performance are also discussed. (C) 1999 Society for Mathematical Biology.
引用
收藏
页码:987 / 1008
页数:22
相关论文
共 50 条
  • [31] A parallel branch and bound algorithm for collapsing knapsack problem
    Chen, G.-L.
    Wu, M.
    Gu, J.
    [J]. Jisuanji Yanjiu yu Fazhan/Computer Research and Development, 2001, 38 (06): : 741 - 745
  • [32] New smoothing SVM algorithm with tight error bound and efficient reduced techniques
    Shuisheng Zhou
    Jiangtao Cui
    Feng Ye
    Hongwei Liu
    Qiang Zhu
    [J]. Computational Optimization and Applications, 2013, 56 : 599 - 617
  • [33] New smoothing SVM algorithm with tight error bound and efficient reduced techniques
    Zhou, Shuisheng
    Cui, Jiangtao
    Ye, Feng
    Liu, Hongwei
    Zhu, Qiang
    [J]. COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 2013, 56 (03) : 599 - 617
  • [34] Computational experience with parallel mixed integerprogramming in a distributed environment
    R.E. Bixby
    W. Cook
    A. Cox
    E.K. Lee
    [J]. Annals of Operations Research, 1999, 90 : 19 - 43
  • [35] A NEW COMPUTATIONAL ALGORITHM FOR FUNCTIONAL INEQUALITY CONSTRAINED OPTIMIZATION PROBLEMS
    TEO, KL
    REHBOCK, V
    JENNINGS, LS
    [J]. AUTOMATICA, 1993, 29 (03) : 789 - 792
  • [36] Computational Experience with a Software Framework for Parallel Integer Programming
    Xu, Y.
    Ralphs, T. K.
    Ladanyi, L.
    Saltzman, M. J.
    [J]. INFORMS JOURNAL ON COMPUTING, 2009, 21 (03) : 383 - 397
  • [37] A Globally Convergent Parallel SSLE Algorithm for Inequality Constrained Optimization
    Luol, Zhijun
    Wang, Lirong
    [J]. JOURNAL OF MATHEMATICS, 2014, 2014
  • [38] A parallel implementation of a computational aeroacoustic algorithm for airfoil noise
    Lockard, DP
    Morris, PJ
    [J]. JOURNAL OF COMPUTATIONAL ACOUSTICS, 1997, 5 (04) : 337 - 353
  • [39] A new efficient algorithm for computational aeroacoustics on parallel processors
    Ozyoruk, Y
    Long, LN
    [J]. JOURNAL OF COMPUTATIONAL PHYSICS, 1996, 125 (01) : 135 - 149
  • [40] Computational aspects of microplane models and a proposed parallel algorithm
    Patzák, B
    Nemecek, J
    Rypl, D
    Bittnar, Z
    [J]. COMPUTATIONAL CONCRETE STRUCTURES TECHNOLOGY, 2000, : 1 - 8