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

On Comparing Neuronal Morphologies with the Constrained Tree-edit-distance

Abstract: The constrained tree-edit-distance provides a computationally practical method for comparing morphologies directly without first extracting distributions of other metrics. The application of the constrained tree-edit-distance to hippocampal dendrites by Heumann and Wittum is reviewed and considered in the context of other applications and potential future uses. The method has been used on neuromuscular projection axons for comparisons of topology as well as on trees for comparing plant architectures with parti… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
11
0

Year Published

2010
2010
2022
2022

Publication Types

Select...
5
1

Relationship

1
5

Authors

Journals

citations
Cited by 10 publications
(11 citation statements)
references
References 11 publications
0
11
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%
“…However, TED is not spatially specific, while node locations are important in detecting morphological error or change. For example, when measuring quality, the double mistake of an extra branch and a missing branch extending from the same parent branch would be ignored by TED (see also Gillette and Grefenstette, 2009). The analogous situation for morphological plasticity would be the growth of one branch simultaneous with the retraction of another (i.e.…”
Section: Previous Relevant Workmentioning
confidence: 99%
“…Methods in this category often aim to find correspondences between two (neuron) trees, as well as to develop a tree distance to measure the quality of the resulting tree alignment. One important development in this direction is the use of a tree edit distance (TED) for aligning neuron trees [ 14 , 15 ]. The tree edit distance can be considered as an extension of the string-edit distance.…”
Section: Introductionmentioning
confidence: 99%