z-logo
Premium
Three‐dimensional statistical modeling of neuronal populations: Illustration with spatial localization of supernumerary neurons in the locus coeruleus of quaking mutant mice
Author(s) -
Burguet Jasmine,
Andrey Philippe,
Rampin Olivier,
Maurin Yves
Publication year - 2009
Publication title -
journal of comparative neurology
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.855
H-Index - 209
eISSN - 1096-9861
pISSN - 0021-9967
DOI - 10.1002/cne.21954
Subject(s) - locus coeruleus , biology , neuroscience , population , nucleus , computation , phenotype , locus (genetics) , anatomy , algorithm , computer science , genetics , gene , demography , sociology
Abstract An algorithm for the three‐dimensional statistical representation of neuronal populations was designed and implemented. Using this algorithm a series of 3D models, calculated from repeated histological experiments, can be combined to provide a synthetic vision of a population of neurons taking into account biological and experimental variability. Based on the point process theory, our algorithm allows computation of neuronal density maps from which isodensity surfaces can be readily extracted and visualized as surface models revealing the statistical organization of the neuronal population under study. This algorithm was applied to the spatial distribution of locus coeruleus (LC) neurons of 30‐ and 90‐day‐old control and quaking mice. By combining 12 3D models of the LC, a region of the nucleus in which a subpopulation of neurons loses its noradrenergic phenotype between 30 and 90 days postnatally was demonstrated in control mice but not in quaking mice, leading to the hyperplasia previously reported in adult mutants. Altogether, this algorithm allows computation of 3D statistical and graphical models of neuronal populations, providing a contribution to quantitative 3D neuroanatomical modeling. J. Comp. Neurol. 513:483–495, 2009. © 2009 Wiley‐Liss, Inc.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here