A constrained edit distance between unordered labeled trees
From MaRDI portal
DOI10.1007/BF01975866zbMATH Open0839.68035OpenAlexW2056708848MaRDI QIDQ1908261FDOQ1908261
Publication date: 18 March 1996
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01975866
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
Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)
Cites Work
- Title not available (Why is that?)
- The Tree-to-Tree Correction Problem
- Title not available (Why is that?)
- The theory and computation of evolutionary distances: Pattern recognition
- Fast parallel and serial approximate string matching
- Some MAX SNP-hard results concerning unordered labeled trees
- Simple Fast Algorithms for the Editing Distance between Trees and Related Problems
- Approximate Tree Matching in the Presence of Variable Length Don′t Cares
- Finding approximate patterns in strings
- On the editing distance between unordered labeled trees
- Threshold decomposition of gray-scale morphology into binary morphology
- Title not available (Why is that?)
Cited In (27)
- A survey of graph edit distance
- Title not available (Why is that?)
- Improved approximation of the largest common subtree of two unordered trees of bounded height
- A survey on tree edit distance and related problems
- Image categorization: Graph edit distance \(+\) edge direction histogram
- Automated methods for the comparison of natural languages
- Computing approximate tree edit distance using relaxation labeling
- A constrained edit distance algorithm between semi-ordered trees
- Characterization of random walks on space of unordered trees using efficient metric simulation
- FAST ALGORITHMS FOR COMPARISON OF SIMILAR UNORDERED TREES
- Computer Vision - ECCV 2004
- Centroid based tree-structured data clustering using vertex/edge overlap and graph edit distance
- Exact algorithms for computing the tree edit distance between unordered trees
- Multi-label classification and extracting predicted class hierarchies
- Constrained tree editing
- Some MAX SNP-hard results concerning unordered labeled trees
- On the editing distance between unordered labeled trees
- Guided Forest Edit Distance: Better Structure Comparisons by Using Domain-knowledge
- Tai mapping hierarchy for rooted labeled trees through common subforest
- Inexact tree pattern matching with 1-degree edit distance using finite automata
- Generalized LCS
- Tractable and intractable variations of unordered tree edit distance
- Alignment distance of regular tree languages
- Alignment distance of regular tree languages
- Statistical shape analysis of simplified neuronal trees
- An edit distance between quotiented trees
- Edit distance between unlabeled ordered 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)
