Exact and approximate algorithms for unordered tree matching

DOI10.1109/21.286387zbMath1371.68253OpenAlexW2121600160MaRDI QIDQ5365715

Dennis Shasha, Zhang, Kaizhong, Frank Y. Shih, Wang, Jason T. L.

Publication date: 9 October 2017

Published in: IEEE Transactions on Systems, Man, and Cybernetics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/21.286387

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Pattern recognition, speech recognition (68T10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Approximation algorithms (68W25)

Related Items (11)

Algorithms for approximate graph matching ⋮ Exact algorithms for computing the tree edit distance between unordered trees ⋮ Efficient exponential-time algorithms for edit distance between unordered trees ⋮ Improved MAX SNP-Hard Results for Finding an Edit Distance between Unordered Trees ⋮ Identifying consensus of trees through alignment ⋮ Data mining in an engineering design environment: OR applications from graph matching ⋮ Unnamed Item ⋮ An algebraic view of the relation between largest common subtrees and smallest common supertrees ⋮ Finding approximate patterns in undirected acyclic graphs ⋮ New and improved algorithms for unordered tree inclusion ⋮ On the complexity of finding a largest common subtree of bounded degree

This page was built for publication: Exact and approximate algorithms for unordered tree matching