𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Fast, approximate algorithm for detection of solvent-inaccessible atoms

✍ Scribed by Weiser, J�rg; Shenkin, Peter S.; Still, W. Clark


Publisher
John Wiley and Sons
Year
1999
Tongue
English
Weight
207 KB
Volume
20
Category
Article
ISSN
0192-8651

No coin nor oath required. For personal study only.

✦ Synopsis


Up to about half of the atoms in biopolymers are inaccessible to solvents. If such atoms can be rapidly identified, time can be saved in the subsequent computation of atomic surface areas. A quick, approximate method, Ž . termed buried atom elimination BAE , was developed for the detection of such atoms. Following the literature, the method makes use of a Gaussian function to calculate the neighbor density in four tetrahedral directions in 3-dimensional space, sometimes twice with different orientations. In macromolecules, our method detects between 63 and 81% of the buried atoms but also incorrectly classifies 2᎐8% of the exposed atoms as buried. These misidentified atoms all Ž . Ž . have small solvent-exposed accessible surface areas SASAs : their surfaces sum to a maximum of 0.5% of the molecular SASA, and their maximum atomic ˚2 SASA is 5.1 A . Using our recently reported LCPO method for computing atomic surfaces, which is one of the fastest available, the use of BAE increases the overall speed of computing the atomic SASAs by a factor of up to 1.6 for surfaces only and 1.9 when first and second derivatives are computed. BAE ˚2 decreases the LCPO average absolute atomic error from about 2.3 A to about ˚2 Ž . 1.7 A average for larger compounds . BAE was introduced into the MacroModel molecular modeling package and tests show that it increases the efficiency of first-and second-derivative energy minimizations and molecular dynamics simulations without adversely affecting the stability or accuracy of the calculations. BAE parameters were developed for the most important atom types in biopolymers, based on a parameterization set of 18 compounds of Ž . Ž different size 33᎐4346 atoms and class organics, proteins, DNA, and various .


📜 SIMILAR VOLUMES


Wavelet-based sparse approximate inverse
✍ R. S. Chen; K. F. Tsang; Lei Mo 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 156 KB

## Abstract In this paper, the wavelet transform technique is used to transform dense matrix equations from the mixed potential integral equation (MPIE) to obtain sparse matrix equations, after dropping elements smaller than the threshold. The multifrontal method is employed to solve the resultant

Sparse approximate inverse preconditioni
✍ P. L. Rui; R. S. Chen 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 177 KB

## Abstract A sparse approximate inverse (SAI) preconditioning of deflated block‐generalized minimal residual (GMRES) algorithm is proposed to solve large dense linear systems with multiple right‐hand sides arising from monostatic radar cross section (RCS) calculations. The multilevel fast multipol

Fast Algorithms for Numerical, Conservat
✍ C. Buet; S. Cordier; P. Degond; M. Lemou 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 482 KB

We present fast numerical algorithms to solve the nonlinear Fokker-Planck-Landau equation in 3D velocity space. The discretization of the collision operator preserves the properties required by the physical nature of the Fokker-Planck-Landau equation, such as the conservation of mass, momentum, an

Sparse approximate inverse preconditione
✍ R. S. Chen; K. F. Tsang; Edward K. N. Yung 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 154 KB

## Abstract In this paper, the multifrontal method is employed to precondition the conjugate gradient (CG) algorithm with the block Toeplitz matrix based fast Fourier transform (FFT) technique for dense matrix equations from the mixed potential integral equation (MPIE) to enhance the computational