A new mathematical modeling for pure parsimony haplotyping problem (Q338689): Difference between revisions

@@ Property / author @@
-Mehri Bagherian
@@ Property / author: Mehri Bagherian / rank @@
-Normal rank
@@ Property / author @@
-Maziar Salahi
@@ Property / author: Maziar Salahi / rank @@
-Normal rank
@@ Property / author @@
+Mehri Bagherian
@@ Property / author: Mehri Bagherian / rank @@
+Normal rank
@@ Property / author @@
+Maziar Salahi
@@ Property / author: Maziar Salahi / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q39384254
@@ Property / Wikidata QID: Q39384254 / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+GERBIL
@@ Property / describes a project that uses: GERBIL / 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.mbs.2016.09.004
+Normal rank
@@ Property / OpenAlex ID @@
+W2518674783
@@ Property / OpenAlex ID: W2518674783 / rank @@
+Normal rank
@@ Property / cites work @@
+Solving haplotyping inference parsimony problem using a new basic polynomial formulation
+Normal rank
@@ Property / cites work @@
+A Class Representative Model for Pure Parsimony Haplotyping
+Normal rank
@@ Property / cites work @@
+The pure parsimony haplotyping problem: overview and computational advances
+Normal rank
@@ Property / cites work @@
+Stochastic local search for large-scale instances of the haplotype inference problem by pure parsimony
+Normal rank
@@ Property / cites work @@
+Q4452087
@@ Property / cites work: Q4452087 / rank @@
+Normal rank
@@ Property / cites work @@
+The phasing of heterozygous traits: Algorithms and complexity
+Normal rank
@@ Property / cites work @@
+A polynomial case of the parsimony haplotyping problem
+Normal rank
@@ Property / cites work @@
+A Set-Covering Approach with Column Generation for Parsimony Haplotyping
+Normal rank
@@ Property / cites work @@
+Haplotyping Populations by Pure Parsimony: Complexity of Exact and Approximation Algorithms
+Normal rank