Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Experiment Videos

Binary tree representation of three-dimensional, reconstructed neuronal trees: a simple, efficient algorithm.

S B Berger, L W Tucker

    Computer Methods and Programs in Biomedicine
    |December 1, 1986
    PubMed
    Summary
    This summary is machine-generated.

    Related Concept Videos

    You might also read

    Related Articles

    Articles linked to this work by shared authors, journal, and citation graph.

    Sort by
    Same author

    Evaluation of Tooth Sensitivity of In-office Bleaching with Different Light Activation Sources: A Systematic Review and a Network Meta-analysis.

    Operative dentistry·2022
    Same author

    Effect of Adhesive Restoration and Bleaching Technique on the Concentration of Hydrogen Peroxide In the Pulp Chamber.

    Operative dentistry·2016
    Same author

    Characterization of GSK'963: a structurally distinct, potent and selective inhibitor of RIP1 kinase.

    Cell death discovery·2016
    Same author

    Life after death: RIP1 and RIP3 move beyond necroptosis.

    Cell death discovery·2016
    Same author

    Drilling into RIP1 biology: what compounds are in your toolkit?

    Cell death & disease·2015
    Same author

    Effects of the concentration and composition of in-office bleaching gels on hydrogen peroxide penetration into the pulp chamber.

    Operative dentistry·2014
    Same journal

    Accounting for approximation errors using surrogate-based parameter estimation of cardiac mechanics digital twins.

    Computer methods and programs in biomedicine·2026
    Same journal

    Facial iPPG heatmap patterns based on period-aware autoencoder show association with carotid atherosclerosis towards non-contact hemodynamic assessment.

    Computer methods and programs in biomedicine·2026
    Same journal

    Explainable machine learning models predict liver fibrosis risk and outcome in the general population: Development and multi-cohort external validation.

    Computer methods and programs in biomedicine·2026
    Same journal

    Evaluation of surrogate endpoints for survival outcomes using the surrogate package in R.

    Computer methods and programs in biomedicine·2026
    Same journal

    Relative spectral and frication-based descriptors as numerical indicators of place of articulation shifts in fricatives produced by Polish children.

    Computer methods and programs in biomedicine·2026
    Same journal

    Leaflet resection improves valve expansion and hemodynamic performance in redo TAVI with balloon- and self-expanding transcatheter heart valve configurations.

    Computer methods and programs in biomedicine·2026
    See all related articles

    This study introduces an efficient algorithm to convert dendritic trees into binary tree representations. This method simplifies neuronal tree analysis, reduces data storage, and speeds up traversal time for quantitative neuroanatomy.

    Area of Science:

    • Neuroscience
    • Computational Biology
    • Computer Science

    Background:

    • Dendritic trees are complex neuronal structures crucial for brain function.
    • Analyzing neuronal morphology is essential for understanding neural circuits.
    • Current methods for analyzing dendritic trees can be computationally intensive and require significant storage.

    Purpose of the Study:

    • To present a simple and efficient algorithm for transforming dendritic trees into binary tree representations.
    • To demonstrate the benefits of binary tree representations for neuronal tree analysis.

    Main Methods:

    • Development of a novel algorithm for dendritic tree to binary tree transformation.
    • Implementation of the algorithm for practical application in neuroanatomical studies.

    Related Experiment Videos

    Main Results:

    • The binary tree representation significantly reduces traversal time for neuronal data.
    • Software development for tree analysis is simplified using this representation.
    • Compact storage of neuronal trees is achieved.

    Conclusions:

    • The proposed algorithm offers an efficient method for representing and analyzing dendritic trees.
    • This approach is valuable for quantitative neuroanatomical studies, enhancing computational efficiency and data management.