A constrained edit distance between unordered labeled trees

DOI10.1007/BF01975866zbMath0839.68035OpenAlexW2056708848MaRDI QIDQ1908261

Zhang, Kaizhong

Publication date: 18 March 1996

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01975866

zbMATH Keywords

unordered labeled treesunordered tree matching

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)

Related Items

Statistical shape analysis of simplified neuronal trees ⋮ Generalized LCS ⋮ Centroid based tree-structured data clustering using vertex/edge overlap and graph edit distance ⋮ Tai mapping hierarchy for rooted labeled trees through common subforest ⋮ TRACTABLE AND INTRACTABLE VARIATIONS OF UNORDERED TREE EDIT DISTANCE ⋮ Characterization of random walks on space of unordered trees using efficient metric simulation ⋮ Exact algorithms for computing the tree edit distance between unordered trees ⋮ Multi-label classification and extracting predicted class hierarchies ⋮ Automated methods for the comparison of natural languages ⋮ Image categorization: Graph edit distance \(+\) edge direction histogram ⋮ Improved approximation of the largest common subtree of two unordered trees of bounded height ⋮ A survey on tree edit distance and related problems ⋮ A survey of graph edit distance ⋮ A constrained edit distance algorithm between semi-ordered trees ⋮ Alignment distance of regular tree languages ⋮ Alignment distance of regular tree languages ⋮ FAST ALGORITHMS FOR COMPARISON OF SIMILAR UNORDERED TREES

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the editing distance between unordered labeled trees
• Some MAX SNP-hard results concerning unordered labeled trees
• Simple Fast Algorithms for the Editing Distance between Trees and Related Problems
• Finding approximate patterns in strings
• Threshold decomposition of gray-scale morphology into binary morphology
• The theory and computation of evolutionary distances: Pattern recognition
• The Tree-to-Tree Correction Problem
• Fast parallel and serial approximate string matching
• Approximate Tree Matching in the Presence of Variable Length Don′t Cares