Exact and approximate algorithms for unordered tree matching

DOI10.1109/21.286387MaRDI QIDQ5365715zbMATH OpenOpenAlexFDO

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

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)

Cited in

(19)

• An efficient algorithm for some tree matching problems
• Algorithms for approximate graph matching
• New and improved algorithms for unordered tree inclusion
• On the complexity of finding a largest common subtree of bounded degree
• Efficient exponential-time algorithms for edit distance between unordered trees
• Data mining in an engineering design environment: OR applications from graph matching
• An algebraic view of the relation between largest common subtrees and smallest common supertrees
• A matching algorithm in PMWL based on CluTree
• Improved MAX SNP-hard results for finding an edit distance between unordered trees
• TWO RELATED ALGORITHMS FOR ROOT-TO-FRONTIER TREE PATTERN MATCHING
• Log-space algorithms for paths and matchings in k-trees
• Approximate Tree Matching in the Presence of Variable Length Don′t Cares
• scientific article; zbMATH DE number 1998340 (Why is no real title available?)
• scientific article; zbMATH DE number 1496857 (Why is no real title available?)
• scientific article; zbMATH DE number 1786462 (Why is no real title available?)
• scientific article; zbMATH DE number 7561381 (Why is no real title available?)
• Identifying consensus of trees through alignment
• Finding approximate patterns in undirected acyclic graphs
• Exact algorithms for computing the tree edit distance between unordered trees

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

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