A constrained edit distance between unordered labeled trees
From MaRDI portal
Recommendations
- On the editing distance between unordered labeled trees
- Constrained tree editing
- Simple Fast Algorithms for the Editing Distance between Trees and Related Problems
- Efficient exponential-time algorithms for edit distance between unordered trees
- Exact algorithms for computing the tree edit distance between unordered trees
Cites work
- scientific article; zbMATH DE number 1638647 (Why is no real title available?)
- scientific article; zbMATH DE number 3936534 (Why is no real title available?)
- scientific article; zbMATH DE number 1256636 (Why is no real title available?)
- Approximate Tree Matching in the Presence of Variable Length Don′t Cares
- Fast parallel and serial approximate string matching
- Finding approximate patterns in strings
- On the editing distance between unordered labeled trees
- Simple Fast Algorithms for the Editing Distance between Trees and Related Problems
- Some MAX SNP-hard results concerning unordered labeled trees
- The Tree-to-Tree Correction Problem
- The theory and computation of evolutionary distances: Pattern recognition
- Threshold decomposition of gray-scale morphology into binary morphology
Cited in
(32)- A constrained edit distance algorithm between semi-ordered trees
- Automated methods for the comparison of natural languages
- Statistical shape analysis of simplified neuronal trees
- Centroid based tree-structured data clustering using vertex/edge overlap and graph edit distance
- An edit distance between quotiented trees
- Guided Forest Edit Distance: Better Structure Comparisons by Using Domain-knowledge
- A survey of graph edit distance
- Characterization of random walks on space of unordered trees using efficient metric simulation
- Tai mapping hierarchy for rooted labeled trees through common subforest
- Constrained tree editing
- Exact algorithms for computing the tree edit distance between unordered trees
- Multi-label classification and extracting predicted class hierarchies
- Edit distance between unlabeled ordered trees
- Inexact tree pattern matching with 1-degree edit distance using finite automata
- scientific article; zbMATH DE number 1796978 (Why is no real title available?)
- FAST ALGORITHMS FOR COMPARISON OF SIMILAR UNORDERED TREES
- Alignment distance of regular tree languages
- Alignment distance of regular tree languages
- A survey on tree edit distance and related problems
- Image categorization: Graph edit distance \(+\) edge direction histogram
- Improved approximation of the largest common subtree of two unordered trees of bounded height
- Some MAX SNP-hard results concerning unordered labeled trees
- Computing approximate tree edit distance using relaxation labeling
- Approximation and parameterized algorithms for common subtrees and edit distance between unordered trees
- Generalized LCS
- New dissimilarity measure for recognizing noisy subsequence trees
- Improved MAX SNP-hard results for finding an edit distance between unordered trees
- Tractable and intractable variations of unordered tree edit distance
- Improved methods for computing distances between unordered trees using integer programming
- Efficient exponential time algorithms for edit distance between unordered trees
- Computer Vision - ECCV 2004
- On the editing distance between unordered labeled trees
This page was built for publication: A constrained edit distance between unordered labeled trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1908261)
