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

DOI10.1016/S0020-0255(99)00100-0zbMath0949.68174OpenAlexW2009066567MaRDI QIDQ1971775

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

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)

Related Items (5)

Graph-theoretic method for merging security system specifications ⋮ Local similarity between quotiented ordered trees ⋮ Finding similar consensus between trees: An algorithm and a distance hierarchy ⋮ Identifying consensus of trees through alignment ⋮ Homeomorphic alignment of weighted trees

Cites Work

• Unnamed Item
• The tree-to-tree editing problem
• Simple Fast Algorithms for the Editing Distance between Trees and Related Problems
• The Tree-to-Tree Correction Problem
• Approximate Tree Matching in the Presence of Variable Length Don′t Cares
• On the complexity of comparing evolutionary trees

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