Email updates

Keep up to date with the latest news and content from BMC Neuroscience and BioMed Central.

This article is part of the supplement: Twenty First Annual Computational Neuroscience Meeting: CNS*2012

Open Access Poster presentation

Structure of the afferent terminals in the terminal ganglion of a cricket and persistent homology

Jacob Brown1* and Tomas Gedeon12

Author Affiliations

1 Department of Mathematical Sciences, Montana State University, Bozeman, MT 59717, USA

2 Center for Computational Biology, Montana State University, Bozeman, MT 59717, USA

For all author emails, please log on.

BMC Neuroscience 2012, 13(Suppl 1):P134  doi:10.1186/1471-2202-13-S1-P134

The electronic version of this article is the complete one and can be found online at:

Published:16 July 2012

© 2012 Brown and Gedeon; licensee BioMed Central Ltd.

This is an Open Access article distributed under the terms of the Creative Commons Attribution License (, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Poster presentation

In many areas of biology there is an abundance of noisy and imprecise data, but often a lack of high precision quantitative data. It is therefore important to design, and use, data analysis methods that are insensitive to small errors in measurements. We present such a robust data analysis as we investigate the three dimensional spatial structure of the locus of afferent neuron terminals in crickets Acheta domesticus. Each afferent neuron innervates a filiform hair positioned on a cercus: a protruding appendage at the rear of the animal. The hairs transduce air motion to the neuron signal that is used by a cricket to respond to the environment. We stratify the hairs (and the corresponding afferent terminals) into four classes, which depend on hair length as well as the position of each hair. Our analysis uncovers significant structure in the relative position of these terminal classes and suggests the functional relevance of this structure. Our method is very robust to the presence of significant experimental and developmental noise. It uses ideas from persistent homology [1-3]. This method is applicable to any point cloud data set that exhibits an underlying topological structure corrupted by noise.

We show that each individual terminal class has similarly positioned significant tunnels and/or voids. However, while each class' point cloud is of similar shape and structure, the space that each class occupies is slightly offset, resulting in no significant tunnels and/or voids in the set of terminals of all hairs. This result is not surprising from an efficiency standpoint: the space in the terminal ganglion is limited and the terminals of afferent neurons are filling the entire available space. While, we emphasize that there are still visible tunnels and/or voids in the entire point cloud, our analysis provides us with the conclusion that these remaining tunnels are not significant, and very likely contain the dendrites of the interneurons in the terminal ganglion. These are downstream from the afferents, and make synaptic contact with the afferent terminal cloud.


We would like to thank Gwen Jacobs and John P. Miller for their generosity in sharing their data, S. Kruger and G. Cummins for help with data analysis and M. Mrozek and K. Mischaikow for sharing the persistence software. This work has been partially supported by NSF grants DMS-081878 and CMMI-0849433, and a DARPA grant 00001741/HR0011-09-1-0055.


  1. Carlsson G: Topology and data.

    Bulletin of the American Mathematical Society 2009, 46(2):255-308. Publisher Full Text OpenURL

  2. Edelsbrunner H, Letscher D, Zomorodian A: Topological persistence and simplification.

    IEEE Symposium on Foundation of Computer Science 2000, 454-463. OpenURL

  3. Goodman JE, Pach J, Pollack R (Eds): Surveys on Discrete and Computational Geometry. Twenty Years Later, chapter Persistent Homology- a Survey

    In Contemporary Mathematics 453. Amer. Math. Soc. Providence, RI 2008, 257-282. OpenURL