Maximum agreement and compatible supertrees (Q2466022): Difference between revisions

@@ Property / DOI @@
-.1016/j.jda.2006.08.005
@@ Property / DOI: 10.1016/j.jda.2006.08.005 / rank @@
-Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.jda.2006.08.005
+Normal rank
@@ Property / OpenAlex ID @@
+W2106706740
@@ Property / OpenAlex ID: W2106706740 / rank @@
+Normal rank
@@ Property / cites work @@
+Inferring a Tree from Lowest Common Ancestors with an Application to the Optimization of Relational Expressions
+Normal rank
@@ Property / cites work @@
+Maximum Agreement Subtree in a Set of Evolutionary Trees: Metrics and Efficient Algorithms
+Normal rank
@@ Property / cites work @@
+Efficient probabilistically checkable proofs and applications to approximations
+Normal rank
@@ Property / cites work @@
+Computing and Combinatorics
@@ Property / cites work: Computing and Combinatorics / rank @@
+Normal rank
@@ Property / cites work @@
+Phylogenetic supertrees. Combining information to reveal the tree of life
+Normal rank
@@ Property / cites work @@
+Extension operations on sets of leaf-labelled trees
+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 @@
+Q2747613
@@ Property / cites work: Q2747613 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating the domatic number
@@ Property / cites work: Approximating the domatic number / rank @@
+Normal rank
@@ Property / cites work @@
+Q4411282
@@ Property / cites work: Q4411282 / rank @@
+Normal rank
@@ Property / cites work @@
+Finding a Maximum Compatible Tree for a Bounded Number of Trees with Bounded Degree Is Solvable in Polynomial Time
+Normal rank
@@ Property / cites work @@
+On the complexity of constructing evolutionary trees
+Normal rank
@@ Property / cites work @@
+Consensus supertrees: The synthesis of rooted trees containing overlapping sets of labeled leaves
+Normal rank
@@ Property / cites work @@
+Finding largest subtrees and smallest supertrees
@@ Property / cites work: Finding largest subtrees and smallest supertrees / rank @@
+Normal rank
@@ Property / cites work @@
+Finding a maximum compatible tree is NP-hard for sequences and trees
+Normal rank
@@ Property / cites work @@
+Fast Algorithms for Finding Nearest Common Ancestors
+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 @@
+Rooted maximum agreement supertrees
@@ Property / cites work: Rooted maximum agreement supertrees / 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 @@
+Q4410170
@@ Property / cites work: Q4410170 / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms and Computation
@@ Property / cites work: Algorithms and Computation / rank @@
+Normal rank
@@ Property / cites work @@
+Q4792088
@@ Property / cites work: Q4792088 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4422502
@@ Property / cites work: Q4422502 / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.JDA.2006.08.005
@@ Property / DOI: 10.1016/J.JDA.2006.08.005 / rank @@
+Normal rank