A simple characterization of the minimal obstruction sets for three-state perfect phylogenies (Q450220): Difference between revisions

@@ Property / arXiv ID @@
+.0874
@@ Property / arXiv ID: 1106.0874 / 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 @@
+The complexity of reconstructing trees from qualitative characters and subtrees
+Normal rank
@@ 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 @@
+A Fast Algorithm for the Computation and Enumeration of Perfect Phylogenies
+Normal rank
@@ Property / cites work @@
+Efficient algorithms for inferring evolutionary trees
+Normal rank
@@ Property / cites work @@
+Convex tree realizations of partitions
@@ Property / cites work: Convex tree realizations of partitions / 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 @@
+The three-state perfect phylogeny problem reduces to 2-SAT
+Normal rank
@@ Property / cites work @@
+Generalizing the Splits Equivalence Theorem and Four Gamete Condition: Perfect Phylogeny on Three-State Characters
+Normal rank
@@ Property / cites work @@
+Q4792088
@@ Property / cites work: Q4792088 / rank @@
+Normal rank