Graph triangulations and the compatibility of unrooted phylogenetic trees (Q628277): 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.aml.2010.12.015
+Normal rank
@@ Property / OpenAlex ID @@
+W1817952903
@@ Property / OpenAlex ID: W1817952903 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4792088
@@ Property / cites work: Q4792088 / rank @@
+Normal rank
@@ Property / cites work @@
+Consensus supertrees: The synthesis of rooted trees containing overlapping sets of labeled leaves
+Normal rank
@@ Property / cites work @@
+The complexity of reconstructing trees from qualitative characters and subtrees
+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 @@
+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 @@
+Q3140412
@@ Property / cites work: Q3140412 / rank @@
+Normal rank
@@ Property / cites work @@
+Quartet compatibility and the quartet graph
@@ Property / cites work: Quartet compatibility and the quartet graph / rank @@
+Normal rank