title: An algorithm for finding candidate synaptic sites in computer generated networks of neurons with realistic morphologies.
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 on 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.
authors.affiliation: Computational Neuroscience Group, Department of Integrative Neurophysiology, Center for Neurogenomics and Cognitive Research, Vrije Universiteit Amsterdam Amsterdam, Netherlands.
authors.forename: Jaap
authors.initials: J
authors.lastname: van Pelt
authors.forename: Andrew
authors.initials: A
authors.lastname: Carnell
authors.forename: Sander
authors.initials: S
authors.lastname: de Ridder
authors.forename: Huibert D
authors.initials: HD
authors.lastname: Mansvelder
authors.forename: Arjen
authors.initials: A
authors.lastname: van Ooyen