2009
DOI: 10.1007/s12021-009-9051-4
|View full text |Cite
|
Sign up to set email alerts
|

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

Abstract: 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 … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
39
0

Year Published

2009
2009
2021
2021

Publication Types

Select...
4
2
1

Relationship

0
7

Authors

Journals

citations
Cited by 41 publications
(40 citation statements)
references
References 33 publications
0
39
0
Order By: Relevance
“…The power of these measures lies in the fact that, much more than any of the previously mentioned measures, they account for the characteristic connectivity and branching patterns of the neuronal trees. Another recently proposed measure to compute the (dis)similarity between any two neurons, known as the constrained tree-editdistance (97,98), takes this idea even a step further. Essentially, it computes the distance between two node-labeled (unordered) trees as the sum of weighted edit operations (label substitutions, node insertions, and deletions) needed to transform (match) one tree exactly into the other, minimized over all feasible edit sequences.…”
Section: Tree Quantificationmentioning
confidence: 99%
“…The power of these measures lies in the fact that, much more than any of the previously mentioned measures, they account for the characteristic connectivity and branching patterns of the neuronal trees. Another recently proposed measure to compute the (dis)similarity between any two neurons, known as the constrained tree-editdistance (97,98), takes this idea even a step further. Essentially, it computes the distance between two node-labeled (unordered) trees as the sum of weighted edit operations (label substitutions, node insertions, and deletions) needed to transform (match) one tree exactly into the other, minimized over all feasible edit sequences.…”
Section: Tree Quantificationmentioning
confidence: 99%
“…One of the best known metrics is TED [1], a method based on the tree-edit distance between unordered labeled tree-graphs. It measures the difference between two trees by counting the number of c 2013.…”
Section: Introductionmentioning
confidence: 99%
“…We extend this work by defining a new metric between trees. 1 The proposed method is based on the Elastic Shape Analysis Framework [5]. This framework was originally developed to compare shapes of curves in the Euclidean space.…”
Section: Introductionmentioning
confidence: 99%
“…In "The Tree-edit-distance, a Measure for Quantifying Neuronal Morphology", Heumann and Wittum's use of the constrained tree-edit-distance between unordered trees on neuronal dendrites provides a new perspective on comparing neuronal morphologies (Heumann and Wittum 2009). The tree-edit-distance offers a more explicit measure of similarity between two neuronal trees that actually represents the topological and geometric changes that would need to be applied to one tree in order to create the second tree.…”
mentioning
confidence: 99%
“…Editorial Note The authors of the target article (Heumann and Wittum 2009) acknowledge that the commentary is correct and thank its authors. They also add that complexity issues have not been considered in the present paper, since there was no problem to run the code on the specified data.…”
mentioning
confidence: 99%