The Tree-Edit-Distance, a Measure for Quantifying Neuronal Morphology

被引:27
|
作者
Heumann, Holger [2 ]
Wittum, Gabriel [1 ]
机构
[1] Goethe Univ Frankfurt, G CSC, D-60325 Frankfurt, Germany
[2] ETH, SAM, CH-8092 Zurich, Switzerland
关键词
Tree-edit-distance; Dissimilarity measure; Cluster analysis; Neuromorphometry; SHAPE; MORPHOMETRY; GENERATION; VOLUME; CELLS; TOOL;
D O I
10.1007/s12021-009-9051-4
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
The shape of neuronal cells strongly resembles botanical trees or roots of plants. To analyze and compare these complex three-dimensional structures it is important to develop suitable methods. We review the so called tree-edit-distance known from theoretical computer science and use this distance to define dissimilarity measures for neuronal cells. This measure intrinsically respects the tree-shape. It compares only those parts of two dendritic trees that have similar position in the whole tree. Therefore it can be interpreted as a generalization of methods using vector valued measures. Moreover, we show that our new measure, together with cluster analysis, is a suitable method for analyzing three-dimensional shape of hippocampal and cortical cells.
引用
收藏
页码:179 / 190
页数:12
相关论文
共 50 条
  • [1] The Tree-Edit-Distance, a Measure for Quantifying Neuronal Morphology
    Holger Heumann
    Gabriel Wittum
    [J]. Neuroinformatics, 2009, 7 : 179 - 190
  • [2] The tree-edit-distance, a measure for quantifying neuronal morphology
    Holger Heumann
    Gabriel Wittum
    [J]. BMC Neuroscience, 10 (Suppl 1)
  • [3] On Comparing Neuronal Morphologies with the Constrained Tree-edit-distance
    Todd A. Gillette
    John J. Grefenstette
    [J]. Neuroinformatics, 2009, 7 : 191 - 194
  • [4] On Comparing Neuronal Morphologies with the Constrained Tree-edit-distance
    Gillette, Todd A.
    Grefenstette, John J.
    [J]. NEUROINFORMATICS, 2009, 7 (03) : 191 - 194
  • [5] A tree-edit-distance algorithm for comparing simple, closed shapes
    Klein, P
    Tirthapura, S
    Sharvit, D
    Kimia, B
    [J]. PROCEEDINGS OF THE ELEVENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2000, : 696 - 704
  • [6] Approximating tree edit distance through string edit distance
    Akutsu, Tatsuya
    Fukagawa, Daiji
    Takasu, Atsuhiro
    [J]. ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2006, 4288 : 90 - +
  • [7] Approximating Tree Edit Distance through String Edit Distance
    Akutsu, Tatsuya
    Fukagawa, Daiji
    Takasu, Atsuhiro
    [J]. ALGORITHMICA, 2010, 57 (02) : 325 - 348
  • [8] Approximating Tree Edit Distance through String Edit Distance
    Tatsuya Akutsu
    Daiji Fukagawa
    Atsuhiro Takasu
    [J]. Algorithmica, 2010, 57 : 325 - 348
  • [9] Approximating Tree Edit Distance through String Edit Distance for Binary Tree Codes
    Aratsu, Taku
    Hirata, Kouichi
    Kuboyama, Tetsuji
    [J]. FUNDAMENTA INFORMATICAE, 2010, 101 (03) : 157 - 171
  • [10] Approximating Tree Edit Distance through String Edit Distance for Binary Tree Codes
    Aratsu, Taku
    Hirata, Kouichi
    Kuboyama, Tetsuji
    [J]. SOFSEM 2009-THEORY AND PRACTICE OF COMPUTER SCIENCE, PROCEEDINGS, 2009, 5404 : 93 - +