Computational Complexity of Perfect-Phylogeny-Related Haplotyping Problems (Q3599136): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-540-85238-4_24
+Normal rank
@@ Property / OpenAlex ID @@
+W1576670503
@@ Property / OpenAlex ID: W1576670503 / rank @@
+Normal rank
@@ Property / cites work @@
+Structure and importance of logspace-MOD class
@@ Property / cites work: Structure and importance of logspace-MOD class / rank @@
+Normal rank
@@ Property / cites work @@
+A decomposition theorem for partially ordered sets
+Normal rank
@@ Property / cites work @@
+Computational Complexity of Perfect-Phylogeny-Related Haplotyping Problems
+Normal rank
@@ Property / cites work @@
+On the complexity of SNP block partitioning under the perfect phylogeny model
+Normal rank
@@ Property / cites work @@
+Haplotyping with missing data via perfect path phylogenies
+Normal rank
@@ Property / cites work @@
+Q4227581
@@ Property / cites work: Q4227581 / 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