FAST ALGORITHMS FOR COMPARISON OF SIMILAR UNORDERED TREES

DOI10.1142/S0129054106004054zbMATH Open1098.68139DBLPjournals/ijfcs/FukagawaA06WikidataQ57371630 ScholiaQ57371630MaRDI QIDQ5483380FDOQ5483380

Authors: Daiji Fukagawa, Tatsuya Akutsu 

Publication date: 14 August 2006

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

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

zbMATH Keywords

edit distancepattern matchingtree alignmentlargest common subtree

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Cites Work

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

Cited In (13)

• An even faster and more unifying algorithm for comparing trees via unbalanced bipartite matchings
• Algorithms and Computation
• Fast algorithms for computing tree LCS
• Fast Algorithms for Computing Tree LCS
• Approximate labelled subtree homeomorphism
• Exact algorithms for computing the tree edit distance between unordered trees
• Title not available (Why is that?)
• Identifying approximately common substructures in trees based on a restricted edit distance
• A Comparison of Many Max-tree Computation Algorithms
• Space efficient algorithms for ordered tree comparison
• Combinatorial Pattern Matching
• Title not available (Why is that?)
• Title not available (Why is that?)

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)