Identifying approximately common substructures in trees based on a restricted edit distance

DOI10.1016/S0020-0255(99)00100-0MaRDI QIDQ1971775zbMATH OpenOpenAlexFDO

Authors Chia-Yo Chang, Jason T. L. Wang, Kaizhong Zhang

Publication date 4 June 2000

Published in Information Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0020-0255(99)00100-0

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Recommendations

• Approximation and special cases of common subtrees and editing distance
• Approximation and parameterized algorithms for common subtrees and edit distance between unordered trees
• Simple Fast Algorithms for the Editing Distance between Trees and Related Problems
• FAST ALGORITHMS FOR COMPARISON OF SIMILAR UNORDERED TREES
• Algorithms and Computation

Cites work

• Approximate Tree Matching in the Presence of Variable Length Don′t Cares
• scientific article; zbMATH DE number 5254145 (Why is no real title available?)
• On the complexity of comparing evolutionary trees
• Simple Fast Algorithms for the Editing Distance between Trees and Related Problems
• The Tree-to-Tree Correction Problem
• The tree-to-tree editing problem

Cited in

(7)

• Largest Weight Common Subtree Embeddings with Distance Penalties
• Finding similar consensus between trees: An algorithm and a distance hierarchy
• Identifying consensus of trees through alignment
• Approximation and special cases of common subtrees and editing distance
• Graph-theoretic method for merging security system specifications
• Local similarity between quotiented ordered trees
• Homeomorphic alignment of weighted trees

This page was built for publication: Identifying approximately common substructures in trees based on a restricted edit distance

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1971775)