FAST ALGORITHMS FOR COMPARISON OF SIMILAR UNORDERED TREES

DOI10.1142/S0129054106004054MaRDI QIDQ5483380zbMATH OpenDBLPWikidataFDO

Authors Daiji Fukagawa, Tatsuya Akutsu

Publication date 14 August 2006

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

zbMATH Keywords

edit distancepattern matchingtree alignmentlargest common subtree

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Recommendations

• Algorithms and Computation
• Alignment of trees -- an alternative to tree edit
• scientific article; zbMATH DE number 1615276
• scientific article; zbMATH DE number 1786462
• scientific article; zbMATH DE number 1998340

Cites work

• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• scientific article; zbMATH DE number 1455130 (Why is no real title available?)
• A constrained edit distance between unordered labeled trees
• Fast algorithms for the unit cost editing distance between trees
• Fast parallel and serial approximate string matching
• Faster Subtree Isomorphism
• On an algorithm of Zemlyachenko for subtree isomorphism
• On finding common subtrees
• On the approximation of largest common subtrees and largest common point sets
• Simple Fast Algorithms for the Editing Distance between Trees and Related Problems
• Some MAX SNP-hard results concerning unordered labeled trees
• Subtree Isomorphism in O(n5/2)
• The Tree-to-Tree Correction Problem
• Tree Pattern Matching to Subset Matching in Linear Time

Cited in

(14)

• Space efficient algorithms for ordered tree comparison
• An even faster and more unifying algorithm for comparing trees via unbalanced bipartite matchings
• On the complexity of finding a largest common subtree of bounded degree
• A Comparison of Many Max-tree Computation Algorithms
• Exact algorithms for computing the tree edit distance between unordered trees
• scientific article; zbMATH DE number 1998340 (Why is no real title available?)
• Approximate labelled subtree homeomorphism
• Identifying approximately common substructures in trees based on a restricted edit distance
• Fast algorithms for computing tree LCS
• scientific article; zbMATH DE number 1786462 (Why is no real title available?)
• scientific article; zbMATH DE number 1615276 (Why is no real title available?)
• Algorithms and Computation
• Fast Algorithms for Computing Tree LCS
• Combinatorial Pattern Matching

This page was built for publication: FAST ALGORITHMS FOR COMPARISON OF SIMILAR UNORDERED TREES

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