Fast compatibility testing for rooted phylogenetic trees (Q724246): Difference between revisions

@@ Property / cites work @@
+Inferring a Tree from Lowest Common Ancestors with an Application to the Optimization of Relational Expressions
+Normal rank
@@ Property / cites work @@
+Compatibility of unrooted phylogenetic trees is FPT
+Normal rank
@@ Property / cites work @@
+A characterisation of rigid circuit graphs
@@ Property / cites work: A characterisation of rigid circuit graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3651735
@@ Property / cites work: Q3651735 / rank @@
+Normal rank
@@ Property / cites work @@
+The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
+Normal rank
@@ Property / cites work @@
+Fast compatibility testing for phylogenies with nested taxa
+Normal rank
@@ Property / cites work @@
+Fast Compatibility Testing for Rooted Phylogenetic Trees
+Normal rank
@@ Property / cites work @@
+An On-Line Edge-Deletion Problem
@@ Property / cites work: An On-Line Edge-Deletion Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Closure operations in phylogenetics
@@ Property / cites work: Closure operations in phylogenetics / rank @@
+Normal rank
@@ Property / cites work @@
+Constructing a tree from homeomorphic subtrees, with applications to computational evolutionary biology
+Normal rank
@@ Property / cites work @@
+Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity
+Normal rank
@@ Property / cites work @@
+An Experimental Study of Polylogarithmic, Fully Dynamic, Connectivity Algorithms
+Normal rank
@@ Property / cites work @@
+Incomplete Directed Perfect Phylogeny
@@ Property / cites work: Incomplete Directed Perfect Phylogeny / rank @@
+Normal rank
@@ Property / cites work @@
+Q4792088
@@ Property / cites work: Q4792088 / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of reconstructing trees from qualitative characters and subtrees
+Normal rank
@@ Property / cites work @@
+Near-optimal fully-dynamic graph connectivity
@@ Property / cites work: Near-optimal fully-dynamic graph connectivity / rank @@
+Normal rank