Haplotype inferring via galled-tree networks using a hypergraph covering problem for special genotype matrices (Q1026186): Difference between revisions

@@ Property / DOI @@
-.1016/j.dam.2008.06.051
@@ Property / DOI: 10.1016/j.dam.2008.06.051 / rank @@
-Normal rank
@@ Property / author @@
-Arvind Kumar Gupta
@@ Property / author: Arvind Kumar Gupta / rank @@
-Normal rank
@@ Property / author @@
+Arvind Kumar Gupta
@@ Property / author: Arvind Kumar Gupta / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+Publication
@@ Property / MaRDI profile type: Publication / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.dam.2008.06.051
+Normal rank
@@ Property / OpenAlex ID @@
+W2093778504
@@ Property / OpenAlex ID: W2093778504 / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal, efficient reconstruction of root-unknown phylogenetic networks with constrained and structured recombination
+Normal rank
@@ Property / cites work @@
+Haplotyping Populations by Pure Parsimony: Complexity of Exact and Approximation Algorithms
+Normal rank
@@ Property / cites work @@
+Q3221403
@@ Property / cites work: Q3221403 / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.DAM.2008.06.051
@@ Property / DOI: 10.1016/J.DAM.2008.06.051 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1026186