...
【24h】

A scaling law derived from optimal dendritic wiring

机译:由最佳树枝状布线得出的缩放定律

获取原文
获取原文并翻译 | 示例
           

摘要

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.
机译:树状树的多样性是神经回路最显着的特征之一。在这里,我们发展了一种通用的定量理论,将树枝状布线的总长度与分支点和突触的数量联系起来。我们表明,最佳布线可预测这些措施之间的2/3功率定律。我们证明了该理论与来自许多不同物种的多种神经元的数据是一致的,并有助于定义树状树中的计算区室。我们的结果暗示与血管,支气管和植物树相比,树突状乔木的设计原理根本不同。

著录项

  • 来源
  • 作者单位

    Wolfson Institute for Biomedical Research and Department of Neuroscience, Physiology, and Pharmacology, University College London, London WC1E 6BT,United Kingdom Institute of Clinical Neuroanatomy, Neuroscience Center, Goethe-University, D-60590 Frankfurt/Main, Germany Ernst Strungmann Institute for Neuroscience in Cooperation with Max Planck Society, D-60528 Frankfurt/Main, Germany;

    Wolfson Institute for Biomedical Research and Department of Neuroscience, Physiology, and Pharmacology, University College London, London WC1E 6BT,United Kingdom;

    Wolfson Institute for Biomedical Research and Department of Neuroscience, Physiology, and Pharmacology, University College London, London WC1E 6BT,United Kingdom;

  • 收录信息 美国《科学引文索引》(SCI);美国《生物学医学文摘》(MEDLINE);美国《化学文摘》(CA);
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类
  • 关键词

    computational neuroscience; branching; dendrite; morphology; minimum spanning tree;

    机译:计算神经科学分枝;枝晶形态学;最小生成树;

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号