A 3-approximation algorithm for the subtree distance between phylogenies (Q1018098): Difference between revisions

@@ Property / cites work @@
+On the computational complexity of the rooted subtree prune and regraft distance
+Normal rank
@@ Property / cites work @@
+Computing the minimum number of hybridization events for a consistent evolutionary history
+Normal rank
@@ Property / cites work @@
+Q4393480
@@ Property / cites work: Q4393480 / rank @@
+Normal rank
@@ Property / cites work @@
+A faster FPT algorithm for the maximum agreement forest problem
+Normal rank
@@ Property / cites work @@
+Reconstructing evolution of sequences subject to recombination using parsimony
+Normal rank
@@ Property / cites work @@
+On the complexity of comparing evolutionary trees
@@ Property / cites work: On the complexity of comparing evolutionary trees / rank @@
+Normal rank
@@ Property / cites work @@
+Q4780791
@@ Property / cites work: Q4780791 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4792088
@@ Property / cites work: Q4792088 / rank @@
+Normal rank