An algorithm for finding candidate synaptic sites

J. van Pelt, A. Carnell, A. de Ridder, H.D. Mansvelder, A. van Ooyen

Research output: Contribution to JournalArticleAcademicpeer-review

Abstract

Neurons make synaptic connections at locations where axons and dendrites are sufficiently close in space. Typically the required proximity is based on the dimensions of dendritic spines and axonal boutons. Based on this principle one can search those locations in networks formed by reconstructed neurons or computer generated neurons. Candidate synapses are then located where axons and dendrites are within a given criterion distance from each other. Both experimentally reconstructed and model generated neurons are usually represented morphologically by piecewise-linear structures (line pieces or cylinders). Proximity tests are then performed on all pairs of line pieces from both axonal and dendritic branches. Applying just a test on the distance between line pieces may result in local clusters of synaptic sites when more than one pair of nearby line pieces from axonal and dendritic branches is sufficient close, and may introduce a dependency on the length scale of the individual line pieces. The present paper describes a new algorithm for defining locations of candidate synapses which is based n the crossing requirement of a line piece pair, while the length of the orthogonal distance between the line pieces is subjected to the distance criterion for testing 3D proximity. © 2010 van Pelt, Carnell, de Ridder, Mansvelder and van Ooyen.
Original languageEnglish
Pages (from-to)148
Number of pages17
JournalFrontiers in Computational Neuroscience
Volume4
DOIs
Publication statusPublished - 2010

Fingerprint Dive into the research topics of 'An algorithm for finding candidate synaptic sites'. Together they form a unique fingerprint.

  • Cite this