PubMed Health⌕ Search

Biomedical subjects

Michael K Gilson

Publications and source records attributed to Michael K Gilson.

4 recordsLinked to original sources
PubMed2002

Accelerated Poisson-Boltzmann calculations for static and dynamic systems.

We report here an efficient implementation of the finite difference Poisson-Boltzmann solvent model based on the Modified Incomplete Cholsky Conjugate Gradient algorithm, which gives rather impressive performance for both static and dynamic systems. This is achieved by implementing the algorithm with Eisenstat's two optimizations, utilizing the electrostatic update in simulations, and applying prudent approximations, including: relaxing the convergence criterion, not updating Poisson-Boltzmann-related forces every step, and using electrostatic focusing. It is also possible to markedly accelerate the supporting routines that are used to set up the calculations and to obtain energies and forces. The resulting finite difference Poisson-Boltzmann method delivers efficiency comparable to the distance-dependent dielectric model for a system tested, HIV Protease, making it a strong candidate for solution-phase molecular dynamics simulations. Further, the finite difference method includes all intrasolute electrostatic interactions, whereas the distance dependent dielectric calculations use a 15-A cutoff. The speed of our numerical finite difference method is comparable to that of the pair-wise Generalized Born approximation to the Poisson-Boltzmann method.

Algorithms↗
PubMed2002

Enhanced docking with the mining minima optimizer: acceleration and side-chain flexibility.

The ligand-protein docking algorithm based on the Mining Minima method has been substantially enhanced. First, the basic algorithm is accelerated by: (1) adaptively determining the extent of each energy well to help avoid previously discovered energy minima; (2) biasing the search away from ligand positions at the surface of the receptor to prevent the ligand from staying at the surface when large sampling regions are used; (3) quickly testing multiple different ligand positions and orientations for each ligand conformation; and (4) tuning the source code to increase computational efficiency. These changes markedly shorten the time needed to discover an accurate result, especially when large sampling regions are used. The algorithm now also allows user-selected receptor sidechains to be treated as mobile during the docking procedure. The energies associated with the mobile side chains are computed as if they belonged to the ligand, except that atoms at the boundary between side chains and the rigid backbone are treated specially. This new capability is tested for several well-known ligand/protein systems, and preliminary application to an enzyme whose substrate is unknown--the recently solved hypothetical protein YecO (HI0319) from Haemophilus influenzae--indicates that side-chains relaxations allow candidate substrates of various sizes to be accommodated.

Algorithms↗
PubMed2002

The Binding Database: data management and interface design.

MOTIVATION: The large and growing body of experimental data on biomolecular binding is of enormous value in developing a deeper understanding of molecular biology, in developing new therapeutics, and in various molecular design applications. However, most of these data are found only in the published literature and are therefore difficult to access and use. No existing public database has focused on measured binding affinities and has provided query capabilities that include chemical structure and sequence homology searches. METHODS & RESULTS: We have created Binding DataBase (BindingDB), a public, web-accessible database of measured binding affinities. BindingDB is based upon a relational data specification for describing binding measurements via Isothermal Titration Calorimetry (ITC) and enzyme inhibition. A corresponding XML Document Type Definition (DTD) is used to create and parse intermediate files during the on-line deposition process and will also be used for data interchange, including collection of data from other sources. The on-line query interface, which is constructed with Java Servlet technology, supports standard SQL queries as well as searches for molecules by chemical structure and sequence homology. The on-line deposition interface uses Java Server Pages and JavaBean objects to generate dynamic HTML and to store intermediate results. The resulting data resource provides a range of functionality with brisk response-times, and lends itself well to continued development and enhancement.

Binding Sites↗