ALGORITHMS, Robert Sedgewick, Addison‐Wesley Publishing Company, 1983. No. of pages: 552. Price: £13·95

Abstract

The spike-time distance metric and the prototype of a collection of point patterns can be used to provide a metric description of repeated observations of point processes. Due to algorithmic limitations in computing spike-time distance, previous work in determining approximations of the prototype has largely been limited to single dimensional or small data sets. We develop new algorithms for each of these methods that are suitable for larger data sets. The first, an incremental matching algorithm, is a method to compute spike-time distance. The second algorithm involves the use of kernel smoothing for prototype construction. These methods readily extend to multiple dimensions and to marked point processes. We use a combination of these approaches to analyze neuronal spike data of cats in different behavioral states and across animals, and we compare our results to previous time series analyses that used averaged frequency histograms. Evidence is found for short latency responses to the acoustic CS that were sensitive to behavioral state.