This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Efficient Parallel Algorithms for Solvent Accessible Surface Area of Proteins
June 2002 (vol. 13 no. 6)
pp. 544-555

We present faster sequential and parallel algorithms for computing the solvent accessible surface area (ASA) of protein molecules. The ASA is computed by finding the exposed surface areas of the spheres obtained by increasing the van der Waals radii of the atoms with the van der Waals radius of the solvent. Using domain specific knowledge, we show that the number of sphere intersections is only O(n), where n is the number of atoms in the protein molecule. For computing sphere intersections, we present hash-based algorithms that run in O(n) expected sequential time and O\left({n\over p}\right) expected parallel time and sort-based algorithms that run in worst-case O\left(n\log n\right) sequential time and O\left({n\log n\over p}\right) parallel time. These are significant improvements over previously known algorithms which take O\left(n^2\right) time sequentially and O\left(\frac{n^2}{p}\right) time in parallel. We present a Monte Carlo algorithm for computing the solvent accessible surface area. The basic idea is to generate points uniformly at random on the surface of spheres obtained by increasing the van der Waals radii of the atoms with the van der Waals radius of the solvent molecule and to test the points for accessibility. We also provide error bounds as a function of the sample size. Experimental verification of the algorithms is carried out using an IBM SP-2.

[1] D.J. Abel and D.M. Mark, “A Comparative Analysis of Some Two-Dimensional Orderings,” Int'l J. Geographical Information Systems, vol. 4, no. 1, pp. 21-31, 1990.
[2] S. Aluru and F. Sevilgen, “Parallel Domain Decomposition and Load Balancing Using Space-Filling Curves,” Proc. Int'l Conf. High Performance Computing, pp. 230-235, 1997.
[3] E.M. Boczko and C. Brooks, “First-Principles Calculation of the Folding Free Energy of a Three-Helix Bundle Protein,” Science, vol. 269, pp. 393-396, 1995.
[4] J.H. Conway and N.J.A. Sloane, Sphere Packings, Lattices and Groups. Springer-Verlag, 1988.
[5] D.G. Covell, “Lattice Model Simulations of Polypeptide Chain Folding,” J. Molecular Biology, vol. 235, pp. 1032-1043, 1994.
[6] D.G. Covell, “Folding Protein$\big. \alpha\bigr.$-Carbon Chains into Compact Forms by Monte Carlo Methods,” PROTEINS: Structure, Function, and Genetics, vol. 14, pp. 409-420, 1992.
[7] K.A. Dill, A.T. Phillips, and J.B. Rosen, “Protein Structure Prediction and Potential Energy Landscape Analysis Using Continuous Global Minimization,” Proc. Int'l Conf. Computational Molecular Biology, pp. 109-117, 1997.
[8] D. Hilbert, “Uber die Stegie Abbildung Einer Linie auf Flachenstuck,” Math. Annalen, vol. 38, pp. 459-460, 1891.
[9] D. Hinds and M. Levitt, “Exploring Conformational Space with a Simple Lattice Model for Protein Structure,” J. Molecular Biology, vol. 243, pp. 668-682, 1994.
[10] H.V. Jagadish, "Linear Clustering of Objects with Multiple Attributes," Proc. Int'l Conf. Management of Data, pp. 332-342, ACM SIGMOD, 1990.
[11] V. Kumar, A. Grama, A. Gupta, and G. Karypis, Introduction to Parallel Computing: Design and Analysis of Algorithms. Benjamin Cummings, 1994.
[12] I. Kuntz, G. Crippen, P. Kollman, and D. Kimmelman, “Calculation of Protein Tertiary Structure,” J. Molecular Biology, vol. 106, pp. 983-994, 1976.
[13] B. Lee and F.M. Richards, “The Interpretation of Protein Structures: Estimation of Static Accessibility,” J. Molecular Biology, vol. 55, pp. 379-400, 1971.
[14] M. Levitt and A. Warshel, “Computer Simulation of Protein Folding,” Nature, vol. 253, pp. 694-698, 1975.
[15] J.H. Lindsey II, “Sphere-Packing in$\big. R^3\bigr.$,” Math., vol. 33, pp. 137-147, 1986.
[16] R.L. Martino, T.K. Yap, and E.B. Suh, “Parallel Algorithms in Molecular Biology,” Proc. High Performance Computing and Networking, pp. 232-240, 1997.
[17] R.L. Martino, C.A. Johnson, E.B. Suh, B.L. Trus, and T.K. Yap, “Parallel Computing in Biomedical Research,” Science, vol. 265, pp. 902-908, 1994.
[18] B. Moon, H.V. Jagadish, C. Faloutsos, and J.H. Saltz, “Analysis of Clustering Properties of Hilbert Space-Filling Curve,” Technical Report No. CS-TR-3590, Univ. of Maryland Dept. of Computer Science, Mar. 1996.
[19] G.M. Morton, “A Computer Oriented Geodetic Data Base and a New Technique in File Sequencing,” IBM technical report, Ottawa, Canada, 1966.
[20] C.W. Ou and S. Ranka, “Parallel Remapping Algorithms for Adaptive Problems,” Proc. Frontiers '95, pp. 367-374, 1995.
[21] P.S. Pacheco, Parallel Programming with MPI. Morgan Kaufmann, 1997.
[22] L.C. Pauling, The Nature of the Chemical Bond, third edition. Ithaca, NY: Cornell Univ. Press, 1960
[23] G. Peano, “Sur une Courbe qui Remplit Toute une Aire Plaine,” Math. Annalen, vol. 36, 1890.
[24] J.R. Pilkington and S.B. Baden, “Dynamic Partitioning of Non-Uniform Structured Workloads with Spacefilling Curves,” IEEE Trans. Parallel and Distributed Systems, vol. 7, no. 3, pp. 288-300, 1996.
[25] S. Ranka, R.V. Shankar, and K.A. Alsabti, “Many-to-Many Communication with Bounded Traffic,” Proc. Frontiers of Massively Parallel Computation, pp. 20-27, 1995.
[26] F.M. Richards, “The Protein Folding Problem,” Scientific Am., pp. 54-63, 1991.
[27] T.J. Richmond, “Solvent Accessible Surface Area and Extended Volume in Proteins—Analytical Equations for Overlapping Spheres and Implications for the Hydrophobic Effect,” J. Molecular Biology, vol. 178, pp. 63-89, 1984.
[28] F. Sevilgen, S. Aluru, and N. Futamura, “A Provably Optimal, Distribution-Independent Parallel Fast Multipole Method,” Proc. Int'l Parallel and Distributed Processing Symp., pp. 77-84, 2000.
[29] A. Shrake and J.A. Rupley, “Environment and Exposure to Solvent of Protein Atoms, Lysozyme and Insulin,” J. Molecular Biology, vol. 79, pp. 351-371, 1973.
[30] J. Skolnick and A. Kolinski, “Simulations of the Folding of a Globular Protein,” Science, vol. 250, pp. 1121-1125, 1990.
[31] E. Suh, B. Narahari, and R. Simha, “Dynamic Load Balancing Schemes for Computing Accessible Surface Area of Protein Molecules,” Proc. Int'l Conf. High Performance Computing, pp. 326-333, 1998.
[32] E. Suh, B.K. Lee, R. Martino, B. Narahari, and A. Choudhary, “Parallel Computation of Solvent Accessible Surface Area of Protein Molecules,” Proc. Int'l Parallel Processing Symp., pp. 685-689, 1993.
[33] S. Vajda, M.S. Jafri, O.U. Sezerman, and C. DeLisi, “Necessary Conditions for Avoiding Incorrect Polypeptide Folds in Conformational Search by Energy Minimization,” Biopolymers, vol. 33, pp. 173-192, 1993.
[34] C. Wilson and S. Doniach, “A Computer Model to Dynamically Simulate Protein Folding—Studies with Crambin,” Proteins: Structure, Function, and Genetics, vol. 18, pp. 193-209, 1989.
[35] K. Yue and K.A. Dill, “Folding Proteins with a Simple Energy Function and Extensive Conformational Searching,” Protein Science, vol. 5, pp. 254-261, 1996.

Index Terms:
Computational biology, accessible surface area, protein folding, parallel algorithm, Monte Carlo.
Citation:
Natsuhiko Futamura, Srinivas Aluru, Desh Ranjan, Bhanu Hariharan, "Efficient Parallel Algorithms for Solvent Accessible Surface Area of Proteins," IEEE Transactions on Parallel and Distributed Systems, vol. 13, no. 6, pp. 544-555, June 2002, doi:10.1109/TPDS.2002.1011399
Usage of this product signifies your acceptance of the Terms of Use.