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

@@ Property / author @@
-Peter J. Humphries
@@ Property / author: Peter J. Humphries / rank @@
-Normal rank
@@ Property / author @@
+Peter J. Humphries
@@ Property / author: Peter J. Humphries / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+HybridNET
@@ Property / describes a project that uses: HybridNET / rank @@
+Normal rank
@@ 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.dam.2012.11.022
+Normal rank
@@ Property / OpenAlex ID @@
+W1988903798
@@ Property / OpenAlex ID: W1988903798 / rank @@
+Normal rank
@@ 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
@@ links / mardi / name / links / mardi / name @@
+Publication:1949091