# A Topological Representation of Branching Neuronal Morphologies

## Abstract

Many biological systems consist of branching structures that exhibit a wide variety of shapes. Our understanding of their systematic roles is hampered from the start by the lack of a fundamental means of standardizing the description of complex branching patterns, such as those of neuronal trees. To solve this problem, we have invented the Topological Morphology Descriptor (TMD), a method for encoding the spatial structure of any tree as a “barcode”, a unique topological signature. As opposed to traditional morphometrics, the TMD couples the topology of the branches with their spatial extents by tracking their topological evolution in 3-dimensional space. We prove that neuronal trees, as well as stochastically generated trees, can be accurately categorized based on their TMD profiles. The TMD retains sufficient global and local information to create an unbiased benchmark test for their categorization and is able to quantify and characterize the structural differences between distinct morphological groups. The use of this mathematically rigorous method will advance our understanding of the anatomy and diversity of branching morphologies.

## Keywords

Topological data analysis Neuronal morphologies Branching morphology Clustering trees## Introduction

The analysis of complex branching structures, such as branched polymers (Alexandrowicz 1985), viscous fingering (Agam et al. 2002), and fractal trees (Mandelbrot and Freeman 1983), is essential for understanding a great variety of physical and biological processes. For example, the fundamental units of the nervous system, neurons, possess highly ramified arborizations (Jan and Jan 2010) that are thought to reflect their involvement in different computational tasks (Cuntz et al. 2007; Zomorrodi et al. 2010; Van Elburg and Van Ooyen 2010; Ferrante et al. 2013). In order to understand the properties of branching morphologies we must study the differences between distinct arbor types. Much effort has therefore been devoted to grouping morphologies into distinct classes (DeFelipe et al. 2013; Markram et al. 2004; The Petilla Interneuron Nomenclature Group P 2008), a categorization process that is important in many fields (Lyons et al. 1999). However, an efficient method for quantitatively analyzing the morphology of such structures has proved difficult to establish.

In general, the properties of branching morphologies have been rigorously studied in two extreme cases: in the limit of the full complexity of the structures (Carlsson 2009), where the entire set of points is used, and in the opposite limit of feature extraction (DeFelipe et al. 2013; Gomez-Gil et al. 2008; Blackman et al. 2014), where a (typically small) number of selected morphometrics (i.e., statistical features) are extracted from the morphology.

Topological data analysis (TDA) has been shown to reliably identify geometric objects based on a sampled point cloud when they are built out of well-understood pieces, such as spheres, cylinders and tori (Carlsson 2009). It suffers, however, from the deficiency that reliable grouping of complex geometric trees by standard TDA methods, such as Rips complexes (Edelsbrunner and Harer 2008), requires thousands of sampled points, which is expensive in terms of both computational complexity and memory requirements.

Feature extraction is thus the only currently feasible solution to establishing a more quantitative approach to analyzing branching morphologies (Scorcioni et al. 2008; Ling et al. 2012; The Petilla Interneuron Nomenclature Group P 2008). While this approach has been efficiently used in specific fields of image recognition (Schurer 1994), the extreme diversity of the branching patterns of neurons (Markram et al. 2004) makes it difficult to identify an optimal set of statistical features that can reliably describe all their shapes. Neuronal classification has traditionally focused on visually distinguishing the shapes observed under a microscope (Masseroli et al. 1993), a method that is subject to large variation between experts (DeFelipe et al. 2013).

As a result, neither using the full point cloud of the trees nor performing expert-dependent feature selection are suitable to reliably study complex branching morphologies. In order to address this issue, we propose a standardized topological descriptor, the Topological Morphology Descriptor (TMD), of any branching morphology. The TMD algorithm encodes the branching pattern of the morphology by discarding local fluctuations with little information content, such as the position of the nodes between branch points and thus reduces the computational complexity of a tree. The TMD couples the topology of the branching structure with the embedding in the metric space, encoding the overall shape of the tree. Note that the TMD is not a complete invariant that fully describes the original tree, but a simplification that retains enough information to perform well in the proposed discrimination tasks, by mapping the tree to a topological representation with less information loss than the usual morphometrics.

*persistence barcode*(Carlsson 2009), Fig. 2b. Each interval encodes the lifetime of a connected component in the underlying structure (see Glossary), identifying when a branch is first detected (birth) and when it connects to a larger subtree (death). This information can be equivalently represented in a

*persistence diagram*(Carlsson 2009), Fig. 2c in which the pair of birth-death times determines a point in the real plane. Either representation greatly simplifies the mathematical analysis of the trees.

This approach provides a simplified comparison process, since distances inspired by persistent homology theory (Carlsson 2009) can be defined between the outputs of the TMD algorithm (see SI: Distances between persistence diagrams). Existing methods for computing distances between trees, such as the *edit distance* (Bille 2005), the *sequence representation* (Gillette and Ascoli 2015; Gillette et al. 2015), the *blastneuron distance* (Wan et al. 2015) and the *functional distortion distance* (Bauer et al. 2014), are in general not universally appropriate, and therefore not biologically useful, and computationally expensive (see SI:Distances between trees).

Our method, in contrast, is applicable to any tree-like structure. We demonstrate its generality by applying it first to a collection of artificial random trees, (see SI: Random trees generation), and then to various groups of neuronal trees (see Information Sharing Statement). Our results show that the TMD of tree shapes can be used effectively to assign a reliability measure to different proposed groupings of random and neuronal trees (Fig. 1). Provided that the available set of morphologies is representative of the biological diversity, we generate a diversity profile (Leinster and Cobbold 2012) that reflects the abundance of species as well as their differences, in order to further investigate the effects of different classification schemes (see SI: Diversity Index).

## Methods

*T*is described by the TMD algorithm. Let

*T*be a rooted, and therefore oriented, tree (Knuth 1998), embedded in \(\mathbb {R}^{3}\). Note that the operation described here is generalizable to trees embedded in any metric space. We denote by \(N := B \cup L\) the set of nodes of

*T*, which is the union of the set of branch points

*B*and the set of leaves

*L*. In the case of a neuron, the root

*R*is the node representing the soma. Each node \(n \in N\) has references to its parent, i.e., the first node on the path toward the root, and to its children. Nodes with the same parent are called siblings.

Let *f* be a real-valued function defined on the set of nodes of *T*. Any function *f* that is defined on the nodes of *T* can be used with the TMD algorithm, such as the radial distance, the path distance, the branch length, or the branch order (see SI, Fig. S4). Alternative functions should serve to reveal shape characteristics that are independent from each other and therefore be suitable for different tasks. For the purpose of this study we define *f* to be the radial distance from the root *R*. For each \(n\in N\), let \(T_{n}\) denote the subtree with root at the node *n*, and \(L_{n}\) the set of leaves of \(T_{n}\). We define a function \(v \colon N \to \mathbb {R}\), computed by the TMD algorithm, by \(v(n) = \max \{ f(x) \,|\, x\in L_{n} \}\). An ordering of siblings can then be defined based on *v*: if \(n_{1}, n_{2} \in N\), are siblings and \(v(n_{1}) < v(n_{2})\), then \(n_{1}\) is younger than \(n_{2}\).

*A*, which keeps a record of the active nodes. Following the path of each leaf \(l \in L\) toward the root

*R*, all but the oldest (with respect to

*v*) siblings are killed, i.e., removed from

*A*, at each branch point. If siblings have the same value

*v*it is equivalent to kill any one of them. For each killed component one interval (birth-death) is added to the persistence barcode (Fig. 2). The older sibling \(c_{m}\) is replaced by its parent in

*A*and the value \(v(p)\) of its parent is set to \(f(c_{m})\). This operation is applied iteratively to all the nodes until the root

*R*is reached. At this point

*A*contains only one component, the largest one.

When all the branches are outgoing, i.e., the radial distance of the origin of a branch is smaller than the radial distance of its terminal point, the TMD algorithm is equivalent to computing the barcode associated to a filtration of concentric spheres of decreasing radii, centered at *R* (Fig. 2). In this case, the birth time of a component is the supremum of the radii of the spheres that do not contain the entire component. The death time is the infimum of the radii of the spheres that contain the branch point at which the component merges with a longer one.

The computational complexity of the TMD algorithm is linear in the number of nodes. Note that the *if* statement in line 9 of the algorithm is critical for the linear complexity. The number of currently active children is saved at each parent node to avoid quadratic complexity.

This process results in a set of intervals on the real line, each of which represents the lifetime of one component of the tree. The TMD algorithm that associates a persistence barcode TMD(\(T,f\)) to a tree *T* is invariant under rotations and translations, as long as the function *f* is also. In this paper, *f* is the radial distance from *R* and as such it is invariant under rotations about the root and rigid translations of the tree in \(\mathbb {R}^{3}\).

The most common topological metric that is used to compare persistence diagrams is the *bottleneck distance* (Edelsbrunner and Harer 2008), denoted \(d_{B}\). Given a matching (i.e., a bijection) between two persistence diagrams \(D_{1}\), \(D_{2}\), we define the \(L_{\infty }\) distance as the maximum distance between matched points. The bottleneck distance \(d_{B}(D_{1}, D_{2})\) is the infimum over all \(L_{\infty }\) distances for the possible matchings between the two persistence diagrams (Edelsbrunner and Harer 2008).

We prove that TMD: \((T, f) \mapsto \) TMD(\(T, f\)) is stable with respect to the bottleneck distance (see SI: Stability of TMD). For \(\epsilon \)-small modifications of certain types in the tree *T*, the persistence diagram TMD(\(T, f\)) is not modified more than \(\mathcal {O}(\epsilon )\). In particular, the method is robust with respect to small perturbations in the positions of the nodes and the addition/ deletion of small branches.

However, none of the standard topological distances between persistence diagrams is appropriate for the comparison of neuronal trees. The bottleneck distance as well as distances stable with respect to it, such as the *persistence distortion distance* (Dey et al. 2015) (see SI: Distances between trees) cannot distinguish diagrams that differ in their short components, which are nevertheless important for the distinction of neuronal morphologies.

We therefore define in the space of the barcodes an alternative distance \(d_{Bar}\) that we use to compare branching morphologies. For each barcode we generate a density profile as follows: \(\forall x \in \mathbb {R}\) the value of the histogram is the number of intervals that contain *x*, i.e., the number of components alive at that point. The TMD-distance between two barcodes TMD(\(T_{1}, f\)) and TMD(\(T_{2}, f\)) is defined as the integral of the absolute differences between the density profiles of the barcodes. This distance is not stable for a large number of \(\epsilon \)-perturbations of the tree, but it is the only distance we are aware of that succeeds in capturing the differences between the short components of persistence barcodes. This distance is similar to Sholl analysis (Sholl 1953) with a few fundamental differences (see SI: Distances between neurons). However, since this density profile collapses the barcodes into a one-dimensional distribution, it fails to capture the local differences between the branching structures of similar neuronal trees.

For this reason, the persistence diagram was also converted into an *unweighted persistence image*, inspired by persistence images introduced in Adams et al. (2016). We choose to use unweighted persistence images, since points close to the diagonal, which represent short components, are important for the discrimination of the neuronal trees, and these points are ignored in the weighted persistence images. The unweighted persistence image representation allows the construction of an average image for groups of trees, which is useful for quantifying the differences between tree types, since we are not aware of any unambiguous and computationally feasible calculation of an average of persistence barcodes or diagrams. This method is based on the discretization of a sum of Gaussian kernels (Scott 2008), centered at the points of the persistence diagram. This discretization generates a matrix of pixel values, encoding the persistence diagram in a vector, called the unweighted persistence image. Machine learning tools, such as decision trees and support vector machines can then be applied to this vector for the classification of the persistence diagrams. Note that the unweighted persistence images, unlike the persistence images defined in Adams et al. (2016), do not satisfy stability for the Euclidean distance between their vectors with respect to the perturbations of trees that we consider (see SI: Stability of TMD).

## Results

We demonstrate the discriminative power of the TMD by applying it to four examples of increasing complexity. The first application is the grouping of artificial random trees that provide a well-defined test case to explore the method’s performance. The random trees are generated by a constrained stochastic algorithm (see SI: Random trees generation) and have properties that can be precisely modified. Next, we have analyzed datasets of more biological relevance: neurons from different species, downloaded from Ascoli et al. (2007), and distinct types of trees obtained from several morphological types of rat cortical pyramidal cells (Romand et al. 2011) (see Information Sharing Statement). This last example is interesting because, although there is biological support for their separation into distinct groups, no rigorous mathematical model has been proposed for their objective classification. Finally, we used the TMD-distance to rank automatic reconstructions from the BigNeuron project (Peng et al. 2015). We thereby illustrate the usefulness of the TMD across non-trivial examples.

Mathematical random trees are defined by a set of parameters that constrain their shape: the tree depth \(T_{d}\), the branch length \(B_{l}\), the branch angle \(B_{a}\), the degree of randomness \(D_{r}\), and the asymmetry of branches \(A_{b}\) (see SI: Random trees generation). We defined a control group as a set of trees generated with predefined parameters (\(T_{d}=5\), \(B_{l}=10\), \(B_{a}=\pi /4\), \(D_{r}=10\%\), \(A_{b}=0.0\)) and independent random seeds. Each parameter was varied individually to generate groups of trees that differed from the control group in only one property. A tree is assigned to the group which is closer based on the comparison of the distances \(d_{Bar}\) between the tree’s barcode and the barcodes of the trees in every group. This distance is used to construct a classifier based on a simple hierarchical clustering algorithm (Ward 1963). The accuracy of this classifier is defined as the percentage of successful trials.

*tree depth*(Fig. 3), with an accuracy of \(96\% \pm 3\%\) (see SI: Random trees grouping). In Fig. 3 the distance matrix indicates the existence of three distinct groups, and the corresponding clustering. The TMD of random trees generated by varying each of the other parameters \(B_{a}\), \(B_{l}\), \(D_{r}\), \(A_{b}\) are grouped with an accuracy of \(88 \%\), \(96 \%\), \(99 \%\) and \(100 \%\) respectively (see SI: Random trees grouping, Figs. S7-S11).

The performance of a supervised classifier trained on the unweighted persistence images (see SI: Supervised Classification, Classification of neuronal trees) of the TMD results is demonstrated by the grouping of neuronal trees from the different species, shown in Fig. 4. The neuronal trees of the five different species are accurately (\(84\%\)) separated into the original groups. We note here that the performance of this process is reliable (\(>70\%\)) even for small training sets that contain only \(25\%\) of the whole dataset (see SI: Classification of neuronal trees).

The separation of the PC trees into four groups cannot be justified based on purely morphological grounds, since there is no coherent difference between the branching patterns of TPC-A and TPC-B (Fig. 5C, D). On the contrary, the separation in three groups (UPC, SPC and TPC -the superset of TPC-A and TPC-B- Fig. 5E, F) is supported by TMD-based classifiers, by detecting the fundamental differences between their branching structures. Therefore, the TMD provides a solid benchmark test to objectively support or disprove proposed classification schemes.

Finally, the TMD algorithm can be used to assess the quality of any manually or automatically reconstructed neuron if a reference morphology is available. The best use case for this application is the datasets of BigNeuron (Peng et al. 2015), a community effort to advance single-neuron automatic reconstruction. The same stack of images of a scanned morphology is used for manual reconstruction (reference morphology) and for automatic reconstructions with a set of algorithms (test set). Due to the large number of reconstructions generated by the BigNeuron project, the analysis of the data requires a high-computational-performance algorithm. The linear complexity of the TMD makes it highly suitable for the analysis of this large dataset.

## Discussion

The morphological diversity of neurons supports the complex information-processing capabilities of the nervous system. A major challenge in neuroscience has therefore been to reliably describe the shape of neurons. We have introduced here the Topological Morphology Descriptor, derived from principles of persistent homology. The TMD of a tree retains enough topological information to allow the systematic comparison between branching morphologies. Therefore, it provides a topological benchmark for the rigorous comparison of different structures and it could advance our understanding of the anatomy and diversity of the neuronal morphologies.

This technique can be applied to any rooted tree equipped with a function defined on its nodes. Further biological examples include botanic trees (Lopez et al. 2010), corals (Kruszyṅski et al. 2007) and roots of plants (Wang et al. 2009). The method is not restricted to trees in \(\mathbb {R}^{3}\), but can be generalized to any subset *T* of a metric space *M*, with a base-point *R*. A persistence barcode can then be extracted using a filtration by concentric spheres in *M* centered at *R*, enabling us to efficiently study the shape of complex multidimensional objects.

While the static neuronal structures presented in this paper are biologically interesting themselves, our method could also be generalized to track the morphological evolution of trees. The topological study of the growth of an embedded tree could be addressed through Multidimensional Persistence (Carlsson and Zomorodian 2009), a new area of TDA, for which computational tools are currently being explored (Lesnick and Wright 2015; Gäfvert 2016). In this case the spherical filtration identifying relevant topological features of the tree could be enriched with a second filtration representing temporal evolution. This application could be useful in agriculture to study growing roots (Wang et al. 2009) and trees, and in neuroscience, to study neurons in the developing brain.

## Notes

### Acknowledgments

Among others, we thank Athanassia Chalimourda and Katherine Turner for helpful conversations in various stages of this research and Jay Coggan for a critical reading of the manuscript. We also thank Hanchuan Peng and Xiaoxiao Liu for providing and curating the BigNeuron datasets. This work was supported by funding for the Blue Brain Project (BBP) from the ETH Domain. P.D. and R.L. were supported part by the Blue Brain Project and by the start-up grant of KH. Partial support for P.D. has been provided by the Advanced Grant of the European Research Council GUDHI (Geometric Understanding in Higher Dimensions). MS was supported by the SNF NCCR “Synapsy”.

### Author Contributions

LK and KH conceived the study. LK developed the topological algorithm with the contribution of PD. PD, KH contributed topological ideas used in the analysis. HM suggested the biological datasets analyzed. RL, MS and JCS gave conceptual advice. All authors discussed the results, wrote the main paper and commented on the manuscript at all stages.

## Supplementary material

## References

- Adams, H., Chepushtanova, S., Emerson, T., Hanson, E., Kirby, M., Motta, F., Nevill, R., Peterson, C., Shipman, P., & Ziegelmeier, L. (2016). Persistence images: A stable vector representation of persistent homology CoRR arXiv:1507.06217.
- Agam, O., Bettelheim, E., Wiegmann, P., & Zabrodin, A. (2002). Viscous fingering and the shape of an electronic droplet in the quantum hall regime.Google Scholar
- Alexandrowicz, Z. (1985). Growth and shape of branched polymers, aggregates and percolating clusters.
*Physics Letters A*,*109*(4), 169–173.CrossRefGoogle Scholar - Ascoli, G.A., Donohue, D., & Halavi, M. (2007). Neuromorpho.org: a central resource for neuronal morphologies.
*Journal of Neuroscience*,*27*(35), 9247–51.CrossRefPubMedGoogle Scholar - Badea, T., & Nathans, J. (2011). Morphologies of mouse retinal ganglion cells expressing transcription factors brn3a, brn3b, and brn3c: Analysis of wild type and mutant cells using genetically-directed sparse labeling.
*Vision Research*,*51*(2), 269–279.CrossRefPubMedGoogle Scholar - Bauer, U., Ge, X., & Wang, Y. (2014).
*Measuring Distance Between Reeb Graphs, SOCG’14*. New York: ACM.Google Scholar - Berry, M., & Bradley, P.M. (1976). The application of network analysis to the study of branching patterns of large dendritic fields.
*Brain Research*,*109*(1), 111–132.CrossRefPubMedGoogle Scholar - Bille, P. (2005). A survey on tree edit distance and related problems. Theoretical Computer Science.Google Scholar
- Blackman, A., Grabuschnig, S., Legenstein, R., & Sjöström, P. (2014). A comparison of manual neuronal reconstruction from biocytin histology or 2-photon imaging: morphometry and computer modeling.
*Front in Neuroanatomy*,*8*(65), 65.Google Scholar - Carlsson, G. (2009). Topology and data.
*Bulletin of American Mathematical Society*,*46*, 255–308.CrossRefGoogle Scholar - Carlsson, G., & Zomorodian, A. (2009). The theory of multidimensional persistence.
*Discrete & Computational Geometry*,*42*(1), 71–93.CrossRefGoogle Scholar - Chiang, A.S., Lin, C.Y., Chuang, C.C., Chang, H.M., & et al. (2011). Three-dimensional reconstruction of brain-wide wiring networks in drosophila at single-cell resolution.
*Current Biology*,*21*(1), 1–11.CrossRefPubMedGoogle Scholar - Cuntz, H., Borst, A., & Segev, I. (2007). Optimization principles of dendritic structure.
*Theoretical Biology and Medical Model*,*4*(21), 21.CrossRefGoogle Scholar - DeFelipe, J., López-Cruz, P.L., Benavides-Piccione, R., & et al. (2013). New insights into the classification and nomenclature of cortical GABAergic interneurons.
*Nature Reviews Neuroscience*,*14*(3), 202–216.CrossRefPubMedPubMedCentralGoogle Scholar - Dey, T., Shi D., & Wang, Y. (2015). Comparing graphs via persistence distortion. In
*SOCG*.Google Scholar - Dieter, J. (2000).
*Accurate Reconstruction of Neuronal Morphology in Computational Neuroscience, Frontiers in Neuroscience*. Boca Raton: CRC Press.Google Scholar - Edelsbrunner, H., & Harer, J. (2008). Persistent homology—a survey. In Goodman, J. E., & Pach, J. (Eds.)
*American Mathematical Society*, (Vol. 453 pp. 257–282). Providence.Google Scholar - Ferrante, M., Migliore, M., & Ascoli, G. (2013). Functional impact of dendritic branch point morphology.
*Journal of Neuroscience*,*33*(5), 2156–65.CrossRefPubMedPubMedCentralGoogle Scholar - Gäfvert, O. (2016). Algorithms for multidimensional persistence.Google Scholar
- Gillette, T.A., & Ascoli, G.A. (2015). Topological characterization of neuronal arbor morphology via sequence representation: I - motif analysis.
*BMC Bioinformatics*,*16*, 216.CrossRefPubMedPubMedCentralGoogle Scholar - Gillette, T., Hosseini, P., & Ascoli, G. (2015). Topological characterization of neuronal arbor morphology via sequence representation: II - global alignment.
*BMC Bioinformatics*,*16*, 209.CrossRefPubMedPubMedCentralGoogle Scholar - Gomez-Gil, P., Ramirez-Cortes, M., Gonzalez-Bernal, J., Pedrero, A.G., Prieto-Castro, C.I., Valencia, D., Lobato, R., & Alonso, J.E. (2008). A feature extraction method based on morphological operators for automatic classification of leukocytes. pp. 227–232.Google Scholar
- Gonzalez-Bellido, P., Peng, H., Yang, J., Georgopoulos, A., & Olberg, R. (2015). Eight pairs of descending visual neurons in the dragonfly give wing motor centers accurate population vector of prey direction.
*Proceedings of the National Academy of Sciences*,*110*(2), 696–701.CrossRefGoogle Scholar - Jan, Y., & Jan, L. (2010). Branching out: mechanisms of dendritic arborization. Nature reviews.
*Neuroscience*,*11*, 316–28.PubMedPubMedCentralGoogle Scholar - Knuth, D. (1998).
*The art of computer programming volume 2: Seminumerical algorithms*. Massachusetts: Reading.Google Scholar - Kruszyṅski, K.J., Kaandorp, J.A., & van Liere, R. (2007). A computational method for quantifying morphological variation in scleractinian corals.
*Coral Reefs*,*26*(4), 831–840.CrossRefGoogle Scholar - Ledderose, J., Sencion, L., Salgado, H., Arias-Carrion, O., & Trevino, M. (2014). A software tool for the analysis of neuronal morphology data.
*International Archives of Medicine*,*7*, 6.CrossRefPubMedPubMedCentralGoogle Scholar - Leinster, T., & Cobbold, C. (2012). Measuring diversity: the importance of species similarity.
*Ecology*,*93*(3), 477–489.CrossRefPubMedGoogle Scholar - Lesnick, M., & Wright, M. (2015). Interactive visualization of 2-d persistence modules. arXiv:1512.00180 [cs, math].
- Ling, C., Hendrickson, M., & Kalil, R. (2012). Morphology, classification, and distribution of the projection neurons in the dorsal lateral geniculate nucleus of the rat.
*PLoS ONE*,*7*, e49161.CrossRefPubMedPubMedCentralGoogle Scholar - Lopez, L.D., Ding, Y., & Yu, J. (2010). Modeling complex unfoliaged trees from a sparse set of images.
*Computer Graphics Forum*,*29*, 2075–2082.CrossRefGoogle Scholar - Lyons, M.J., Budynek, J., & Akamatsu, S. (1999). Automatic classification of single facial images.
*IEEE Transactions on Pattern Analysis and Machine Intelligence*,*21*(12), 1357–1362.CrossRefGoogle Scholar - Mandelbrot, B., & Freeman, W. (1983). The fractal geometry of nature.
*Earth Surface Processes and Landforms*,*8*(4), 406.Google Scholar - Markram, H., Toledo-Rodriguez, M., Wang, Y., Gupta, A., Silberberg, G., & Wu, C. (2004). Interneurons of the neocortical inhibitory system.
*Nature Reviews Neuroscience*,*5*(10), 793–807.CrossRefPubMedGoogle Scholar - Masseroli, M., Bollea, A., & Forloni, G. (1993). Quantitative morphology and shape classification of neurons by computerized image analysis.
*Computer Methods and Programs in Biomedicine*,*41*(2), 89–99.CrossRefPubMedGoogle Scholar - Peng, H., Hawrylycz, M., Roskams, J., Hill, S., Spruston, N., Meijering, E., & Ascoli, G.A. (2015). BigNeuron: large-scale 3D neuron reconstruction from optical microscopy images.
*Neuron*,*87*, 252–256.CrossRefPubMedPubMedCentralGoogle Scholar - Romand, S., Wang, Y., Toledo-Rodriguez, M., & Markram, H. (2011). Morphological development of thick-tufted layer v pyramidal cells in the rat somatosensory cortex.
*Frontiers in neuroanatomy*,*5*, 5.CrossRefPubMedPubMedCentralGoogle Scholar - Rose, P., Jones, T., Nirula, R., & Corneil, T. (1995). Innervation of motoneurons based on dendritic orientation.
*Journal of Neurophysiology*,*73*(3), 1319–1322.CrossRefPubMedGoogle Scholar - Schurer, T. (1994). An experimental comparison of different feature extraction and classification methods for telephone speech. pp. 93–96.Google Scholar
- Scorcioni, R., Polavaram, S., & Ascoli, G. (2008). L-measure: a web-accessible tool for the analysis, comparison, and search of digital reconstructions of neuronal morphologies.
*Nature Protocols*,*3*, 866–76.CrossRefPubMedPubMedCentralGoogle Scholar - Scott, D. (2008).
*Kernel density estimators*, (pp. 125–193): Wiley.Google Scholar - Sholl, D.A. (1953). Dendritic organization in the neurons of the visual and motor cortices of the cat.
*Journal of Anatomy*,*87*, 387–406.PubMedPubMedCentralGoogle Scholar - Snider, J., Pillai, A., & Stevens, C.F. (2010). A universal property of axonal and dendritic arbors.
*Neuron*,*66*, 45–56.CrossRefPubMedGoogle Scholar - Strahler, A.N. (1952). Hypsometric analysis of erosional topography.
*Bulletin of the Geological Society of Science*,*63*, 1117–1142.CrossRefGoogle Scholar - The Petilla Interneuron Nomenclature Group P (2008). Petilla terminology: nomenclature of features of gabaergic interneurons of the cerebral cortex.
*Nature Reviews Neuroscience*,*9*(7), 557–568.CrossRefGoogle Scholar - Van Elburg, R., & Van Ooyen, A. (2010). Impact of dendritic size and dendritic topology on burst firing in pyramidal cells.
*PLoS Computational Biology*,*6*(5), 1–19.Google Scholar - Van Pelt, J., Verwer, R.W., & Uylings, H.B.M. (1989). Centrifugal-order distributions in binary topological trees.
*Bulletin of Mathematical Biology*,*51*(4), 511–536.CrossRefGoogle Scholar - Van Pelt, J., Uylings, H.B.M., Verwer, R.W.H., Pentney, R.J., & Woldenberg, M.J. (1991). Tree asymmetry—A sensitive and practical measure for binary topological trees.
*Bulletin of Mathematical Biology*,*54*(5), 759–784.CrossRefGoogle Scholar - Van Pelt, J., Van Ooyen, A., & Uylings, H.B.M. (2001). Modeling dendritic geometry and the development of nerve connections. In de Schutter, E., & Cannon, R.C. (Eds.)
*(CD-ROM) Computational Neuroscience: Realistic Modeling for Experimentalist*(pp. 179–208). Boca Raton: CRC Press.Google Scholar - Van Pelt, J., Van Ooyen, A., & Uylings, H.B.M. (2005). Natural variability in the geometry of dendritic branching patterns. In Reeke, G. N., Poznanski, R. R., Lindsay, K. A., Rosenberg, J. R., & Sporns, O. (Eds.)
*Modeling in the Neurosciences: From Biological Systems to Neuromimetic Robotics*(pp. 89–115). Boca Raton: CRC Press.Google Scholar - Wan, Y., Long, F., Qu, L., Xiao, H., Hawrylycz, M., Myers, E.W., & Peng, H. (2015). Blastneuron for automated comparison, retrieval and clustering of 3d neuron morphologies.
*Neuroinformatics*,*13*(4), 487–499.CrossRefPubMedGoogle Scholar - Wang, H., Siopongco, J., Wade, L., & Yamauchi, A. (2009). Fractal analysis on root systems of rice plants in response to drought stress.
*Environmental and Experimental Botany*,*65*(2–3), 338–344.CrossRefGoogle Scholar - Ward, J.H.J. (1963). Hierarchical grouping to optimize an objective function.
*American Statistics Association*,*58*(301), 236–244.CrossRefGoogle Scholar - Zomorrodi, R., Ferecskó, A., Kovács, K., Kröger, H., & Timofeev, I. (2010). Analysis of morphological features of thalamocortical neurons from the ventroposterolateral nucleus of the cat.
*The Journal of Comparative Neurology*,*518*(17), 3541–3556.CrossRefPubMedGoogle Scholar

## Copyright information

**Open Access**This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.