FAST ALGORITHMS FOR COMPARISON OF SIMILAR UNORDERED TREES

DOI10.1142/S0129054106004054zbMath1098.68139WikidataQ57371630 ScholiaQ57371630MaRDI QIDQ5483380

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

pattern matchingedit distancetree alignmentlargest common subtree

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Related Items (1)

Exact algorithms for computing the tree edit distance between unordered trees

Cites Work

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

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