The tree-edit-distance, a measure for quantifying neuronal morphology [PDF]
BMC Neuroscience, 2009 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 ...
Wittum Gabriel, Heumann Holger
doaj +6 more sources
Imaging-based representation and stratification of intra-tumor heterogeneity via tree-edit distance [PDF]
Scientific Reports, 2022 Personalized medicine is the future of medical practice. In oncology, tumor heterogeneity assessment represents a pivotal step for effective treatment planning and prognosis prediction. Despite new procedures for DNA sequencing and analysis, non-invasive
Lara Cavinato +3 more
doaj +2 more sources
Tree edit distance for leaf-labelled trees on free leafset and its comparison with frequent subsplit dissimilarity and popular distance measures [PDF]
BMC Bioinformatics, 2011 Background This paper is devoted to distance measures for leaf-labelled trees on free leafset. A leaf-labelled tree is a data structure which is a special type of a tree where only leaves (terminal) nodes are labelled.
Walczak Krzysztof, Koperwas Jakub
doaj +2 more sources
Author Correction: Imaging-based representation and stratification of intra-tumor heterogeneity via tree-edit distance [PDF]
Scientific Reports, 2022 Lara Cavinato +5 more
doaj +2 more sources
Application of Computer Vision to the Automated Extraction of Metadata from Natural History Specimen Labels: A Case Study on Herbarium Specimens [PDF]
PlantsMetadata extraction from natural history collection labels is a pivotal task for the online publication of digitized specimens. However, given the scale of these collections—which are estimated to host more than 2 billion specimens worldwide, including ...
Jacopo Zacchigna +6 more
doaj +2 more sources
Comparative Analysis of Merge Trees Using Local Tree Edit Distance [PDF]
IEEE Transactions on Visualization and Computer Graphics, 2023 Comparative analysis of scalar fields is an important problem with various applications including feature-directed visualization and feature tracking in time-varying data. Comparing topological structures that are abstract and succinct representations of the scalar fields lead to faster and meaningful comparison.
Raghavendra Sridharamurthy +1 more
openaire +3 more sources
TOWARDS ON EXPERIMENTAL COMPARISON OF THE M-TREE INDEX STRUCTURE WITH BK-TREE AND VP-TREE [PDF]
Acta Electrotechnica et Informatica, 2020 In our previous paper, we showed the M-tree index [7] using GiST in the PostgreSQL database. In this paper, we present that result and we extend that with some preliminary experimental results with other indexes.
Gergo GOMBOS +3 more
doaj +1 more source
Similar Supergraph Search Based on Graph Edit Distance
Algorithms, 2021 Subgraph and supergraph search methods are promising techniques for the development of new drugs. For example, the chemical structure of favipiravir—an antiviral treatment for influenza—resembles the structure of some components of RNA.
Masataka Yamada, Akihiro Inokuchi
doaj +1 more source
Approximating Tree Edit Distance through String Edit Distance [PDF]
Algorithmica, 2006 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Akutsu, Tatsuya +2 more
openaire +2 more sources
Edit distance between unlabeled ordered trees [PDF]
RAIRO - Theoretical Informatics and Applications, 2004 Algorithmique et ...
Micheli, Anne, Rossin, Dominique
openaire +4 more sources