Integer Programming Approaches to Haplotype Inference by Pure Parsimony
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Haplotyping Populations by Pure Parsimony: Complexity of Exact and Approximation Algorithms
INFORMS Journal on Computing
Efficient haplotype inference with boolean satisfiability
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Efficient haplotype inference with answer set programming
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
Haplotype inference by pure Parsimony
CPM'03 Proceedings of the 14th annual conference on Combinatorial pattern matching
Efficient haplotype inference with pseudo-boolean optimization
AB'07 Proceedings of the 2nd international conference on Algebraic biology
Loop-separable programs and their first-order definability
Artificial Intelligence
Applications of answer set programming in phylogenetic systematics
Logic programming, knowledge representation, and nonmonotonic reasoning
Hi-index | 0.00 |
Identifying maternal and paternal inheritance is essential to be able to find the set of genes responsible for a particular disease. However, due to technological limitations, we have access to genotype data (genetic makeup of an individual), and determining haplotypes (genetic makeup of the parents) experimentally is a costly and time consuming procedure. With these biological motivations, we study haplotype inference--determining the haplotypes that form a given set of genotypes--using Answer Set Programming; we call our approach Haplo-ASP . This note summarizes the range of problems that can be handled by Haplo-ASP , and its applicability and effectiveness on real data in comparison with the other existing approaches.