An \(O(n\log n)\)-time algorithm for the maximum constrained agreement subtree problem for binary trees (Q845850): Difference between revisions

@@ Property / cites work @@
+Computing and Combinatorics
@@ Property / cites work: Computing and Combinatorics / rank @@
+Normal rank
@@ Property / cites work @@
+An <i>O</i>(<i>n</i>log <i>n</i>) Algorithm for the Maximum Agreement Subtree Problem for Binary Trees
+Normal rank
@@ Property / cites work @@
+Combinatorial Pattern Matching
@@ Property / cites work: Combinatorial Pattern Matching / rank @@
+Normal rank
@@ Property / cites work @@
+Q3128909
@@ Property / cites work: Q3128909 / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient algorithms for inferring evolutionary trees
+Normal rank
@@ Property / cites work @@
+Q3138927
@@ Property / cites work: Q3138927 / rank @@
+Normal rank
@@ Property / cites work @@
+Tree Contractions and Evolutionary Trees
@@ Property / cites work: Tree Contractions and Evolutionary Trees / rank @@
+Normal rank
@@ Property / cites work @@
+Q4938785
@@ Property / cites work: Q4938785 / rank @@
+Normal rank
@@ Property / cites work @@
+An Even Faster and More Unifying Algorithm for Comparing Trees via Unbalanced Bipartite Matchings
+Normal rank
@@ Property / cites work @@
+An algorithm to find agreement subtrees
@@ Property / cites work: An algorithm to find agreement subtrees / rank @@
+Normal rank
@@ Property / cites work @@
+Kaikoura tree theorems: Computing the maximum agreement subtree
+Normal rank