Computer Simulation of Biological Ion Channels

Abstract

This thesis describes a project in which algorithms are developed for the rapid and accurate solution of Poisson's equation in the presence of a dielectric boundary and multiple point charges. These algorithms are then used to perform Brownian dynamics simulations on realistic models of biological ion channels. An iterative method of solution, in which the dielectric boundary is tiled with variable sized surface charge sectors, provides the flexibility to deal with arbitrarily shaped boundaries, but is too slow to perform Brownian dynamics. An analytical solution is derived, which is faster and more accurate, but only works for a toroidal boundary. Finally, a method is developed of pre-calculating solutions to Poisson's equation and storing them in tables. The solution for a particular configuration of ions in the channel can then be assembled by interpolation from the tables and application of the principle of superposition. This algorithm combines the flexibility of the iterative method with greater speed even than the analytical method, and is fast enough that channel conductance can be predicted. The results of simulations for a model single-ion channel, based on the acetylcholine receptor channel, show that the narrow pore through the low dielectric strength medium of the protein creates an energy barrier which restricts the permeation of ions. They further show that this barrier can be removed by dipoles in the neck of the channel, but that the barrier is not removed by shielding by counter-ions. The results of simulations for a model multi-ion channel, based on a bacterial potassium channel, show that the model channel has conductance characteristics similar to those of real potassium channels. Ions appear to move through the model multi-ion channel via rapid transitions between a series of semi-stable states. This observation suggests a possible physical basis for the reaction rate theory of channel conductance, and opens up an avenue for future research.