Results 11 to 20 of about 7,310 (242)
Learning probabilistic models of tree edit distance [PDF]
Pattern Recognition, 2008 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bernard, Marc +3 more
openaire +6 more sources
Tree edit distance: Robust and memory-efficient
Information Systems, 2016 Hierarchical data are often modelled as trees. An interesting query identifies pairs of similar trees. The standard approach to tree similarity is the tree edit distance, which has successfully been applied in a wide range of applications. In terms of runtime, the state-of-the-art algorithm for the tree edit distance is RTED, which is guaranteed to be ...
Pawlik, Mateusz, Augsten, Nikolaus
openaire +4 more sources
Efficient Computation of the Tree Edit Distance
ACM Transactions on Database Systems, 2015 We consider the classical tree edit distance between ordered labelled trees, which is defined as the minimum-cost sequence of node edit operations that transform one tree into another. The state-of-the-art solutions for the tree edit distance are not satisfactory. The main competitors in the field either have optimal worst-case complexity but the worst
Pawlik, Mateusz, Augsten, Nikolaus
openaire +4 more sources
Decomposition algorithms for the tree edit distance problem
Journal of Discrete Algorithms, 2005 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dulucq, Serge, Touzet, Hélène
openaire +5 more sources
Classifying Conserved RNA Secondary Structures With Pseudoknots by Vector-Edit Distance
IEEE Access, 2021 Secondary structures have been proved to relate with the great functional diversity of RNA. There have been many studies to predict and compare the RNA secondary structures. However, fast and accurate comparison of RNA secondary structures with arbitrary
Liyu Huang +3 more
doaj +1 more source
Edit Distance between Merge Trees
IEEE Transactions on Visualization and Computer Graphics, 2020 Topological structures such as the merge tree provide an abstract and succinct representation of scalar fields. They facilitate effective visualization and interactive exploration of feature-rich data. A merge tree captures the topology of sub-level and super-level sets in a scalar field.
Raghavendra Sridharamurthy +3 more
openaire +3 more sources
An Edit Distance between Quotiented Trees [PDF]
Algorithmica, 2003 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ferraro, Pascal, Godin, Christophe
openaire +3 more sources
IEEE Access, 2020 Tree comparison is an important method in various areas. In order to compare class hierarchy in object-oriented languages, there is a need to compare trees in the context of the hierarchy changes.
Danijel Mlinaric +2 more
doaj +1 more source
A generalized Robinson-Foulds distance for labeled trees
BMC Genomics, 2020 Background The Robinson-Foulds (RF) distance is a well-established measure between phylogenetic trees. Despite a lack of biological justification, it has the advantages of being a proper metric and being computable in linear time.
Samuel Briand +4 more
doaj +1 more source
Applied Sciences, 2021 A core task in technology management in biomedical engineering and beyond is the classification of patents into domain-specific categories, increasingly automated by machine learning, with the fuzzy language of patents causing particular problems ...
Kai Frerich +3 more
doaj +1 more source