File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1073/pnas.1200430109
- Scopus: eid_2-s2.0-84863571443
- PMID: 22715290
- Find via
Supplementary
- Citations:
- Appears in Collections:
Article: A scaling law derived from optimal dendritic wiring
Title | A scaling law derived from optimal dendritic wiring |
---|---|
Authors | |
Keywords | Branching Computational neuroscience Dendrite Minimum spanning tree Morphology |
Issue Date | 2012 |
Citation | Proceedings of the National Academy of Sciences of the United States of America, 2012, v. 109, n. 27, p. 11014-11018 How to Cite? |
Abstract | The wide diversity of dendritic trees is one of the most striking features of neural circuits. Here we develop a general quantitative theory relating the total length of dendritic wiring to the number of branch points and synapses. We show that optimal wiring predicts a 2/3 power law between these measures. We demonstrate that the theory is consistent with data from a wide variety of neurons across many different species and helps define the computational compartments in dendritic trees. Our results imply fundamentally distinct design principles for dendritic arbors compared with vascular, bronchial, and botanical trees. |
Persistent Identifier | http://hdl.handle.net/10722/343466 |
ISSN | 2023 Impact Factor: 9.4 2023 SCImago Journal Rankings: 3.737 |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Cuntz, Hermann | - |
dc.contributor.author | Mathy, Alexandre | - |
dc.contributor.author | Häusser, Michael | - |
dc.date.accessioned | 2024-05-10T09:08:21Z | - |
dc.date.available | 2024-05-10T09:08:21Z | - |
dc.date.issued | 2012 | - |
dc.identifier.citation | Proceedings of the National Academy of Sciences of the United States of America, 2012, v. 109, n. 27, p. 11014-11018 | - |
dc.identifier.issn | 0027-8424 | - |
dc.identifier.uri | http://hdl.handle.net/10722/343466 | - |
dc.description.abstract | The wide diversity of dendritic trees is one of the most striking features of neural circuits. Here we develop a general quantitative theory relating the total length of dendritic wiring to the number of branch points and synapses. We show that optimal wiring predicts a 2/3 power law between these measures. We demonstrate that the theory is consistent with data from a wide variety of neurons across many different species and helps define the computational compartments in dendritic trees. Our results imply fundamentally distinct design principles for dendritic arbors compared with vascular, bronchial, and botanical trees. | - |
dc.language | eng | - |
dc.relation.ispartof | Proceedings of the National Academy of Sciences of the United States of America | - |
dc.subject | Branching | - |
dc.subject | Computational neuroscience | - |
dc.subject | Dendrite | - |
dc.subject | Minimum spanning tree | - |
dc.subject | Morphology | - |
dc.title | A scaling law derived from optimal dendritic wiring | - |
dc.type | Article | - |
dc.description.nature | link_to_subscribed_fulltext | - |
dc.identifier.doi | 10.1073/pnas.1200430109 | - |
dc.identifier.pmid | 22715290 | - |
dc.identifier.scopus | eid_2-s2.0-84863571443 | - |
dc.identifier.volume | 109 | - |
dc.identifier.issue | 27 | - |
dc.identifier.spage | 11014 | - |
dc.identifier.epage | 11018 | - |
dc.identifier.eissn | 1091-6490 | - |