Identification of bursts in spike trains

J. H. Cocatre-Zilgien, F. Delcomyn

Research output: Contribution to journalArticlepeer-review

Abstract

A computer algorithm to identify 'bursts' in trains of spikes is described. The algorithm works by constructing a histogram of interspike intervals, then analyzing the histogram to detect the critical interval value in the distribution that represents the break between short intervals within a burst and the longer intervals between bursts. When such a value is found, it is used as the 'threshold' to determine those intervals in the spike train that lie within a burst and those that lie between bursts and, thereby, to identify the beginning and end of each burst in the train. The validity of the bursts is evaluated with a chi-square test. The performance of the algorithm and how it can be assessed is discussed.

Original languageEnglish (US)
Pages (from-to)19-30
Number of pages12
JournalJournal of Neuroscience Methods
Volume41
Issue number1
DOIs
StatePublished - Jan 1992

Keywords

  • Algorithm
  • Burst identification
  • Interspike interval histogram: Pattern analysis
  • Spike train

ASJC Scopus subject areas

  • General Neuroscience

Fingerprint

Dive into the research topics of 'Identification of bursts in spike trains'. Together they form a unique fingerprint.

Cite this