Haplotype Inferring Via Galled-Tree Networks Is NP-Complete (Q3511338): 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.1007/978-3-540-69733-6_29
+Normal rank
@@ Property / OpenAlex ID @@
+W2096634448
@@ Property / OpenAlex ID: W2096634448 / rank @@
+Normal rank
@@ Property / cites work @@
+On the computational complexity of the rooted subtree prune and regraft distance
+Normal rank
@@ Property / cites work @@
+Haplotype inferring via galled-tree networks using a hypergraph covering problem for special genotype matrices
+Normal rank
@@ Property / cites work @@
+Optimal, efficient reconstruction of root-unknown phylogenetic networks with constrained and structured recombination
+Normal rank
@@ Property / cites work @@
+The Fine Structure of Galls in Phylogenetic Networks
+Normal rank
@@ Property / cites work @@
+Haplotyping Populations by Pure Parsimony: Complexity of Exact and Approximation Algorithms
+Normal rank
@@ Property / cites work @@
+Q4298260
@@ Property / cites work: Q4298260 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:3511338