Algorithmic approaches for the single individual haplotyping problem (Q2805490): Difference between revisions

@@ Property / OpenAlex ID @@
+W2323920142
@@ Property / OpenAlex ID: W2323920142 / rank @@
+Normal rank
@@ Property / cites work @@
+Polynomial and APX-hard cases of the individual haplotyping problem
+Normal rank
@@ Property / cites work @@
+Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
+Normal rank
@@ Property / cites work @@
+The complexity of the single individual SNP haplotyping problem
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Opportunities for Combinatorial Optimization in Computational Biology
+Normal rank
@@ Property / cites work @@
+Q3655083
@@ Property / cites work: Q3655083 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4796705
@@ Property / cites work: Q4796705 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4408101
@@ Property / cites work: Q4408101 / rank @@
+Normal rank
@@ Property / cites work @@
+An improved (and practical) parameterized algorithm for the individual haplotyping problem MFR with mate-pairs
+Normal rank
@@ Property / cites work @@
+Haplotype assembly from aligned weighted SNP fragments
+Normal rank