Approximation algorithms
A Practical Algorithm for Optimal Inference of Haplotypes from Diploid Populations
Proceedings of the Eighth International Conference on Intelligent Systems for Molecular Biology
Haplotype inference by pure Parsimony
CPM'03 Proceedings of the 14th annual conference on Combinatorial pattern matching
Parameterized Complexity
Solving haplotyping inference parsimony problem using a new basic polynomial formulation
Computers & Mathematics with Applications
The phasing of heterozygous traits: Algorithms and complexity
Computers & Mathematics with Applications
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Computational Complexity of Perfect-Phylogeny-Related Haplotyping Problems
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
A Set-Covering Approach with Column Generation for Parsimony Haplotyping
INFORMS Journal on Computing
A Decomposition of the Pure Parsimony Haplotyping Problem
ISBRA '09 Proceedings of the 5th International Symposium on Bioinformatics Research and Applications
On the Approximability of Some Haplotyping Problems
AAIM '09 Proceedings of the 5th International Conference on Algorithmic Aspects in Information and Management
Haplotype Inference Constrained by Plausible Haplotype Data
CPM '09 Proceedings of the 20th Annual Symposium on Combinatorial Pattern Matching
A Class Representative Model for Pure Parsimony Haplotyping
INFORMS Journal on Computing
Extended islands of tractability for parsimony haplotyping
CPM'10 Proceedings of the 21st annual conference on Combinatorial pattern matching
Pure Parsimony Xor Haplotyping
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Improved approximation bounds for the minimum rainbow subgraph problem
Information Processing Letters
Haplotype Inference Constrained by Plausible Haplotype Data
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
WABI'06 Proceedings of the 6th international conference on Algorithms in Bioinformatics
On the complexity of several haplotyping problems
WABI'05 Proceedings of the 5th International conference on Algorithms in Bioinformatics
Using genetic algorithm in reconstructing single individual haplotype with minimum error correction
Journal of Biomedical Informatics
| Hi-index | 0.00 |
The parsimony haplotyping problem was shown to be NP-hard when each genotype had k==0 ambiguous positions.