Pages that link to "Item:Q1908261"
From MaRDI portal
The following pages link to A constrained edit distance between unordered labeled trees (Q1908261):
Displaying 29 items.
- A survey on tree edit distance and related problems (Q557823) (← links)
- Exact algorithms for computing the tree edit distance between unordered trees (Q620949) (← links)
- Multi-label classification and extracting predicted class hierarchies (Q622024) (← links)
- A survey of graph edit distance (Q710632) (← links)
- Image categorization: Graph edit distance \(+\) edge direction histogram (Q936445) (← links)
- Improved approximation of the largest common subtree of two unordered trees of bounded height (Q975557) (← links)
- A constrained edit distance algorithm between semi-ordered trees (Q1006058) (← links)
- On the editing distance between unordered labeled trees (Q1198043) (← links)
- Some MAX SNP-hard results concerning unordered labeled trees (Q1318750) (← links)
- Constrained tree editing (Q1328503) (← links)
- An edit distance between quotiented trees (Q1402214) (← links)
- Statistical shape analysis of simplified neuronal trees (Q1620982) (← links)
- Approximation and parameterized algorithms for common subtrees and edit distance between unordered trees (Q1935809) (← links)
- Centroid based tree-structured data clustering using vertex/edge overlap and graph edit distance (Q2158649) (← links)
- Generalized LCS (Q2378524) (← links)
- Tai mapping hierarchy for rooted labeled trees through common subforest (Q2398215) (← links)
- Inexact tree pattern matching with 1-degree edit distance using finite automata (Q2689648) (← links)
- Efficient Exponential Time Algorithms for Edit Distance between Unordered Trees (Q2904510) (← links)
- Tractable and intractable variations of unordered tree edit distance (Q2929619) (← links)
- New dissimilarity measure for recognizing noisy subsequence trees (Q2997938) (← links)
- Edit distance between unlabeled ordered trees (Q3423140) (← links)
- Guided Forest Edit Distance: Better Structure Comparisons by Using Domain-knowledge (Q3506922) (← links)
- Computing approximate tree edit distance using relaxation labeling (Q4417661) (← links)
- FAST ALGORITHMS FOR COMPARISON OF SIMILAR UNORDERED TREES (Q5483380) (← links)
- Computer Vision - ECCV 2004 (Q5713837) (← links)
- Alignment distance of regular tree languages (Q5919581) (← links)
- Alignment distance of regular tree languages (Q5920054) (← links)
- Characterization of random walks on space of unordered trees using efficient metric simulation (Q6069174) (← links)
- Automated methods for the comparison of natural languages (Q6163813) (← links)