Q5002720 (Q5002720): Difference between revisions

@@ Property / cites work @@
+Simulating branching programs with edit distance and friends: or: a polylog shaved is a lower bound made
+Normal rank
@@ Property / cites work @@
+Approximating tree edit distance through string edit distance
+Normal rank
@@ Property / cites work @@
+Approximating Tree Edit Distance through String Edit Distance for Binary Tree Codes
+Normal rank
@@ Property / cites work @@
+Edit Distance Cannot Be Computed in Strongly Subquadratic Time (unless SETH is false)
+Normal rank
@@ Property / cites work @@
+A survey on tree edit distance and related problems
+Normal rank
@@ Property / cites work @@
+On the average number of rebalancing operations in weight-balanced trees
+Normal rank
@@ Property / cites work @@
+Q4607965
@@ Property / cites work: Q4607965 / rank @@
+Normal rank
@@ Property / cites work @@
+Dictionary matching and indexing with errors and don't cares
+Normal rank
@@ Property / cites work @@
+An optimal decomposition algorithm for tree edit distance
+Normal rank
@@ Property / cites work @@
+Decomposition algorithms for the tree edit distance problem
+Normal rank
@@ Property / cites work @@
+Compressing and indexing labeled trees, with applications
+Normal rank
@@ Property / cites work @@
+Pattern Matching in Trees
@@ Property / cites work: Pattern Matching in Trees / rank @@
+Normal rank
@@ Property / cites work @@
+Q4952689
@@ Property / cites work: Q4952689 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4252025
@@ Property / cites work: Q4252025 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2768381
@@ Property / cites work: Q2768381 / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient Computation of the Tree Edit Distance
@@ Property / cites work: Efficient Computation of the Tree Edit Distance / rank @@
+Normal rank
@@ Property / cites work @@
+Comparison of AESA and LAESA search algorithms using string and tree-edit-distances
+Normal rank
@@ Property / cites work @@
+Fast algorithms for the unit cost editing distance between trees
+Normal rank
@@ Property / cites work @@
+A data structure for dynamic trees
@@ Property / cites work: A data structure for dynamic trees / rank @@
+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 @@
+The String-to-String Correction Problem
@@ Property / cites work: The String-to-String Correction Problem / rank @@
+Normal rank