Pages that link to "Item:Q557823"
From MaRDI portal
The following pages link to A survey on tree edit distance and related problems (Q557823):
Displaying 50 items.
- Which XML schemas are streaming bounded repairable? (Q269345) (← links)
- Supervised classification and mathematical optimization (Q339559) (← links)
- A metric normalization of tree edit distance (Q352044) (← links)
- Simulation relations for pattern matching in directed graphs (Q388784) (← links)
- A survey on tree matching and XML retrieval (Q394973) (← links)
- A metric for rooted trees with unlabeled vertices based on nested parentheses (Q410711) (← links)
- Faster bit-parallel algorithms for unordered pseudo-tree matching and tree homeomorphism (Q450558) (← links)
- A framework for succinct labeled ordinal trees over large alphabets (Q487027) (← links)
- Approximate XML structure validation based on document-grammar tree similarity (Q527155) (← links)
- Algorithms for finding a most similar subforest (Q538470) (← links)
- Exact algorithms for computing the tree edit distance between unordered trees (Q620949) (← links)
- A survey of graph edit distance (Q710632) (← links)
- On the parameterized complexity of associative and commutative unification (Q729894) (← links)
- Fast algorithms for computing tree LCS (Q732018) (← links)
- Tree inclusions in windows and slices (Q843598) (← links)
- A relation between edit distance for ordered trees and edit distance for Euler strings (Q845840) (← links)
- Kernelization and parameterized algorithms for covering a tree by a set of stars or paths (Q897955) (← links)
- A theory of subtree matching and tree kernels based on the edit distance concept (Q906000) (← links)
- Space efficient algorithms for ordered tree comparison (Q930598) (← links)
- Learning probabilistic models of tree edit distance (Q931691) (← links)
- Improved approximation of the largest common subtree of two unordered trees of bounded height (Q975557) (← links)
- Comparing trees via crossing minimization (Q988574) (← links)
- Dimension reduction in principal component analysis for trees (Q1623457) (← links)
- An expressive dissimilarity measure for relational clustering using neighbourhood trees (Q1698849) (← links)
- Dynamic path queries in linear space (Q1799220) (← links)
- Good edit similarity learning by loss minimization (Q1945121) (← links)
- An improved algorithm for tree edit distance with applications for RNA secondary structure comparison (Q2015811) (← links)
- New and improved algorithms for unordered tree inclusion (Q2049980) (← links)
- A new matching algorithm between trees of shapes and its application to brain tumor segmentation (Q2061786) (← links)
- Stability of the tree of shapes to additive noise (Q2061821) (← links)
- Reconstructing trees from traces (Q2075329) (← links)
- Local versus global distances for zigzag and multi-parameter persistence modules (Q2080087) (← links)
- A generalized Weisfeiler-Lehman graph kernel (Q2102326) (← links)
- Recursive tree grammar autoencoders (Q2102393) (← links)
- Fast similarity search for graphs by edit distance (Q2174059) (← links)
- Covering tree with stars (Q2354301) (← links)
- Succinct indices for path minimum, with applications (Q2362355) (← links)
- Generalized LCS (Q2378524) (← links)
- Approximating tree edit distance through string edit distance (Q2379923) (← links)
- Tai mapping hierarchy for rooted labeled trees through common subforest (Q2398215) (← links)
- Efficient exponential-time algorithms for edit distance between unordered trees (Q2442818) (← links)
- The graph matching problem (Q2444585) (← links)
- Predicting the fault-proneness of class hierarchy in object-oriented software using a layered kernel (Q2519435) (← links)
- Algebraic dynamic programming on trees (Q2633220) (← links)
- Tree structure for contractible regions in \(\mathbb R^{3}\) (Q2642730) (← links)
- On the Parameterized Complexity of Associative and Commutative Unification (Q2946004) (← links)
- New dissimilarity measure for recognizing noisy subsequence trees (Q2997938) (← links)
- Improved MAX SNP-Hard Results for Finding an Edit Distance between Unordered Trees (Q3011871) (← links)
- (Q5002720) (← links)
- Quasifibrations of graphs to find symmetries and reconstruct biological networks (Q5055404) (← links)
