Pyramidal neuron coincidence detection tuned by dendritic branching pattern (Schaefer et al 2003)

 Download zip file   Auto-launch 
Help downloading and running models
"... We examined the relationship between dendritic arborization and the coupling between somatic and dendritic action potential (AP) initiation sites in layer 5 (L5) neocortical pyramidal neurons. Coupling was defined as the relative reduction in threshold for initiation of a dendritic calcium AP due to a coincident back-propagating AP. Simulations based on reconstructions of biocytin-filled cells showed that addition of oblique branches of the main apical dendrite in close proximity to the soma (d < 140 um) increases the coupling between the apical and axosomatic AP initiation zones, whereas incorporation of distal branches decreases coupling. ... We conclude that variation in dendritic arborization may be a key determinant of variability in coupling (49+-17%; range 19-83%; n = 37) and is likely to outweigh the contribution made by variations in active membrane properties. Thus coincidence detection of inputs arriving from different cortical layers is strongly regulated by differences in dendritic arborization."
1 . Schaefer AT, Larkum ME, Sakmann B, Roth A (2003) Coincidence detection in pyramidal neurons is tuned by their dendritic branching pattern. J Neurophysiol 89:3143-54 [PubMed]
Citations  Citation Browser
Model Information (Click on a link to find other models with that property)
Model Type: Neuron or other electrically excitable cell;
Brain Region(s)/Organism:
Cell Type(s): Neocortex L5/6 pyramidal GLU cell;
Channel(s): I Na,t; I A; I K; I M; I K,Ca; I Calcium;
Gap Junctions:
Simulation Environment: NEURON;
Model Concept(s): Action Potential Initiation; Coincidence Detection;
Implementer(s): Schaefer, Andreas T [andreas.schaefer at];
Search NeuronDB for information about:  Neocortex L5/6 pyramidal GLU cell; I Na,t; I A; I K; I M; I K,Ca; I Calcium;
cad2.mod *
child.mod *
childa.mod *
epsp.mod *
it2.mod *
kaprox.mod *
kca.mod *
km.mod *
kv.mod *
na.mod *
SlowCa.mod *
 iterator for traversing all the descendants of the currently accessed section
 section subtree_traverse("statement")
 executes statement for section and every descendant of section.
 Just before the statement is executed the currently accessed section is set.
 	SUFFIX nothing
 #define get_child(sec) _nrn_mechanism_get_child(sec)
 #define get_sibling(sec) _nrn_mechanism_get_sibling(sec)
 #define get_child(sec) sec->child
 #define get_sibling(sec) sec->sibling
 static void subtree(Section* sec, Symbol* sym) {
 	nrn_pushsec(sec);	/* move these three (sec becomes child) */
 	hoc_run_stmt(sym);	/* into the loop to do only the first level */
 	for (Section* child = get_child(sec); child; child = get_sibling(child)) {
 		subtree(child, sym);
 #ifndef NRN_VERSION_GTEQ_8_2_0
 Section* chk_access();
 Symbol* hoc_parse_stmt();
 PROCEDURE subtree_traverse_all() {
 	Symlist* symlist = (Symlist*)0;
 	subtree(chk_access(), hoc_parse_stmt(gargstr(1), &symlist));
 	/* if following not executed (ie hoc error in statement),
 	   some memory will leak */