Closure operations in phylogenetics (Q2382399): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.mbs.2006.11.005
+Normal rank
@@ Property / OpenAlex ID @@
+W1971820137
@@ Property / OpenAlex ID: W1971820137 / 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 @@
+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 @@
+Algorithmic Aspects of Tree Amalgamation
@@ Property / cites work: Algorithmic Aspects of Tree Amalgamation / rank @@
+Normal rank
@@ Property / cites work @@
+A few logs suffice to build (almost) all trees (I)
+Normal rank
@@ Property / cites work @@
+When are two qualitative taxonomic characters compatible?
+Normal rank
@@ Property / cites work @@
+Recovering a phylogenetic tree using pairwise closure operations
+Normal rank
@@ Property / cites work @@
+A phase transition for a random cluster model on phylogenetic trees.
+Normal rank
@@ Property / cites work @@
+Reconstructing minimal rooted trees.
@@ Property / cites work: Reconstructing minimal rooted trees. / rank @@
+Normal rank
@@ Property / cites work @@
+Q4532074
@@ Property / cites work: Q4532074 / 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