Search

Two-dimensional (2D) dwell-time analysis of time series of single-channel patch-clamp current was improved by employing a Hinkley detector for jump detection, introducing a genetic fit algorithm, replacing maximum likelihood by a least square criterion, averaging over a field of 9 or 25 bins in the 2D plane and normalizing per measuring time, not per events. Using simulated time series for the generation of the "theoretical" 2D histograms from assumed Markov models enabled the incorporation of the measured filter response and noise. The effects of these improvements were tested with respect to the temporal resolution, accuracy of the determination of the rate constants of the Markov model, sensitivity to noise and requirement of open time and length of the time series. The 2D fit was better than the classical hidden Markov model (HMM) fit in all tested fields. The temporal resolution of the two most efficient algorithms, the 2D fit and the subsequent HMM/beta fit, enabled the determination of rate constants 10 times faster than the corner frequency of the low-pass filter. The 2D fit was much less sensitive to noise. The requirement of computing time is a problem of the 2D fit (100 times that of the HMM fit) but can now be handled by personal computers. The studies revealed a fringe benefit of 2D analysis: it can reveal the "true" single-channel current when the filter has reduced the apparent current level by averaging over undetected fast gating.

Level or jump detectors generate the reconstructed time series from a noisy record of patch-clamp current. The reconstructed time series is used to create dwell-time histograms for the kinetic analysis of the Markov model of the investigated ion channel. It is shown here that some additional lines in the software of such a detector can provide a powerful new means of patch-clamp analysis. For each current level that can be recognized by the detector, an array is declared. The new software assigns every data point of the original time series to the array that belongs to the actual state of the detector. From the data sets in these arrays distributions-per-level are generated. Simulated and experimental time series analyzed by Hinkley detectors are used to demonstrate the benefits of these distributions-per-level. First, they can serve as a test of the reliability of jump and level detectors. Second, they can reveal beta distributions as resulting from fast gating that would usually be hidden in the overall amplitude histogram. Probably the most valuable feature is that the malfunctions of the Hinkley detectors turn out to depend on the Markov model of the ion channel. Thus, the errors revealed by the distributions-per-level can be used to distinguish between different putative Markov models of the measured time series.

Fast gating in time series of patch-clamp current demands powerful tools to reveal the rate constants of the adequate Hidden Markov model. Here, two approaches are presented to improve the temporal resolution of the direct fit of the time series. First, the prediction algorithm is extended to include intermediate currents between the nominal levels as caused by the anti-aliasing filter. This approach can reveal rate constants that are about 4 times higher than the corner frequency of the anti-aliasing filter. However, this approach is restricted to time series with very low noise. Second, the direct fit of the time series is combined with a beta fit, i.e., a fit of the deviations of the amplitude histogram from the Gaussian distribution. Since the “theoretical” amplitude histograms for higher-order Bessel filters cannot be calculated by analytical tools, they are generated from simulated time series. In a first approach, a simultaneous fit of the time series and of the Beta fit is tested. This simultaneous fit, however, inherits the drawbacks of both approaches, not the benefits. More successful is a subsequent fit: The fit of the time series yields a set of rate constants. The subsequent Beta fit uses the slow rate constants of the fit of the time series as fixed parameters and the optimization algorithm is restricted to the fast ones. The efficiency of this approach is illustrated by means of time series obtained from simulation and from the dominant K+ channel in Chara. This shows that temporal resolution can reach the microsecond range. [ABSTRACT FROM AUTHOR]