On the complexity of computing the temporal hybridization number for two phylogenies (Q1949091): Difference between revisions

@@ Property / cites work @@
+Bounding the number of hybridisation events for a consistent evolutionary history
+Normal rank
@@ Property / cites work @@
+Computing the minimum number of hybridization events for a consistent evolutionary history
+Normal rank
@@ Property / cites work @@
+Fundamentals of Computation Theory
@@ Property / cites work: Fundamentals of Computation Theory / rank @@
+Normal rank
@@ Property / cites work @@
+When two trees go to war
@@ Property / cites work: When two trees go to war / rank @@
+Normal rank
@@ Property / cites work @@
+Constructing the simplest possible phylogenetic network from triplets
+Normal rank
@@ Property / cites work @@
+Analyzing and reconstructing reticulation networks under timing constraints
+Normal rank
@@ Property / cites work @@
+Q3221403
@@ Property / cites work: Q3221403 / rank @@
+Normal rank
@@ Property / cites work @@
+Optimization, approximation, and complexity classes
+Normal rank
@@ Property / cites work @@
+Q4792088
@@ Property / cites work: Q4792088 / rank @@
+Normal rank