Minimizing phylogenetic number to find good evolutionary trees (Q5961621): Difference between revisions

@@ Property / cites work @@
+A Polynomial-Time Algorithm For the Perfect Phylogeny Problem When the Number of Character States is Fixed
+Normal rank
@@ Property / cites work @@
+SIMPLE ALGORITHMS FOR PERFECT PHYLOGENY AND TRIANGULATING COLORED GRAPHS
+Normal rank
@@ Property / cites work @@
+Q4091421
@@ Property / cites work: Q4091421 / rank @@
+Normal rank
@@ Property / cites work @@
+Two strikes against perfect phylogeny
@@ Property / cites work: Two strikes against perfect phylogeny / rank @@
+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 @@
+Incidence matrices and interval graphs
@@ Property / cites work: Incidence matrices and interval graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Inferring Evolutionary History From DNA Sequences
@@ Property / cites work: Inferring Evolutionary History From DNA Sequences / rank @@
+Normal rank
@@ Property / cites work @@
+Q4886095
@@ Property / cites work: Q4886095 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3317150
@@ Property / cites work: Q3317150 / rank @@
+Normal rank
@@ Property / cites work @@
+Triangulating Vertex-Colored Graphs
@@ Property / cites work: Triangulating Vertex-Colored Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of reconstructing trees from qualitative characters and subtrees
+Normal rank