FAST ALGORITHMS FOR COMPARISON OF SIMILAR UNORDERED TREES (Q5483380): Difference between revisions

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