Solving haplotyping inference parsimony problem using a new basic polynomial formulation (Q929154): Difference between revisions

@@ Property / author @@
-Paola Bertolazzi
@@ Property / author: Paola Bertolazzi / rank @@
-Normal rank
@@ Property / author @@
+Paola Bertolazzi
@@ Property / author: Paola Bertolazzi / 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.camwa.2006.12.095
+Normal rank
@@ Property / OpenAlex ID @@
+W2016778388
@@ Property / OpenAlex ID: W2016778388 / rank @@
+Normal rank
@@ Property / cites work @@
+Haplotyping Populations by Pure Parsimony: Complexity of Exact and Approximation Algorithms
+Normal rank
@@ Property / cites work @@
+A polynomial case of the parsimony haplotyping problem
+Normal rank
@@ Property / cites work @@
+A New Formulation and Resolution Method for the p-Center Problem
+Normal rank
@@ Property / cites work @@
+A New Algorithm for Generating All the Maximal Independent Sets
+Normal rank